{"id":"https://openalex.org/W4205190214","doi":"https://doi.org/10.3390/a15020030","title":"Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems","display_name":"Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems","publication_year":2022,"publication_date":"2022-01-18","ids":{"openalex":"https://openalex.org/W4205190214","doi":"https://doi.org/10.3390/a15020030"},"language":"en","primary_location":{"id":"doi:10.3390/a15020030","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020030","pdf_url":"https://www.mdpi.com/1999-4893/15/2/30/pdf?version=1642510905","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/2/30/pdf?version=1642510905","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077814737","display_name":"Kelin Luo","orcid":"https://orcid.org/0000-0003-2006-0601"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Kelin Luo","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits C. R. Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077814737"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0775,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.31578511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"30","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12392","display_name":"Sharing Economy and Platforms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6929776668548584},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6466360688209534},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.5438705682754517},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47939085960388184},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4765499234199524},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.462695449590683},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.43121668696403503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36123865842819214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34997522830963135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.231326162815094},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10034993290901184},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.09849739074707031},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09298202395439148},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07894346117973328}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6929776668548584},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6466360688209534},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.5438705682754517},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47939085960388184},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4765499234199524},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.462695449590683},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.43121668696403503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36123865842819214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34997522830963135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.231326162815094},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10034993290901184},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.09849739074707031},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09298202395439148},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07894346117973328},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3390/a15020030","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020030","pdf_url":"https://www.mdpi.com/1999-4893/15/2/30/pdf?version=1642510905","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/cd117c19-3576-406f-99cc-f22329da5fde","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/cd117c19-3576-406f-99cc-f22329da5fde","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Luo, K & Spieksma, F C R 2022, 'Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems', Algorithms, vol. 15, no. 2, 30. https://doi.org/10.3390/a15020030","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:98fe1a71c2834bff81d2ac3ec40f15d4","is_oa":true,"landing_page_url":"https://doaj.org/article/98fe1a71c2834bff81d2ac3ec40f15d4","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 2, p 30 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/2/30/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15020030","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 2; Pages: 30","raw_type":"Text"},{"id":"pmh:oai:pure.tue.nl:publications/cd117c19-3576-406f-99cc-f22329da5fde","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85123059553&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Luo, K & Spieksma, F C R 2022, 'Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems', Algorithms, vol. 15, no. 2, 30. https://doi.org/10.3390/a15020030","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/cd117c19-3576-406f-99cc-f22329da5fde","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/cd117c19-3576-406f-99cc-f22329da5fde","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 15(2):30. Multidisciplinary Digital Publishing Institute (MDPI)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.3390/a15020030","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020030","pdf_url":"https://www.mdpi.com/1999-4893/15/2/30/pdf?version=1642510905","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4205190214.pdf","grobid_xml":"https://content.openalex.org/works/W4205190214.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W2014998043","https://openalex.org/W2064526960","https://openalex.org/W2128123518","https://openalex.org/W2134554813","https://openalex.org/W2136955469","https://openalex.org/W2145569785","https://openalex.org/W2156266293","https://openalex.org/W2346450482","https://openalex.org/W2476974423","https://openalex.org/W2565919573","https://openalex.org/W2578909013","https://openalex.org/W2789143183","https://openalex.org/W2888820970","https://openalex.org/W2889758147","https://openalex.org/W2949691426","https://openalex.org/W2992739612","https://openalex.org/W3037111733","https://openalex.org/W3082798162","https://openalex.org/W3088503202","https://openalex.org/W3098994962","https://openalex.org/W3125549756","https://openalex.org/W4205585032","https://openalex.org/W4207022808","https://openalex.org/W4242099633"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W2810411596","https://openalex.org/W2499461890","https://openalex.org/W1991566967","https://openalex.org/W1854155592","https://openalex.org/W2476148062","https://openalex.org/W276709744","https://openalex.org/W4385597667","https://openalex.org/W2173317315"],"abstract_inverted_index":{"Motivated":[0],"by":[1,229],"applications":[2],"in":[3],"ride-sharing":[4],"and":[5,17,35,38,53,73,96,100,118,143,153,232,250,264],"truck-delivery,":[6],"we":[7,135,206,216],"study":[8],"the":[9,67,71,76,106,112,121,127,137,141,164,189,204,211,218,222,225,230,234,239,256,259,262],"problem":[10],"of":[11,15,24,29,32,41,46,49,70,109,124,146,224,258],"matching":[12],"a":[13,33,36,39,50,54,58,62,147,170,242],"number":[14,23,40,108,123],"requests":[16,42,110,125],"assigning":[18],"them":[19],"to":[20,104,119,183,203],"cars.":[21],"A":[22],"cars":[25],"are":[26,43,155,181,253],"given,":[27,44],"each":[28,45,193],"which":[30,47,168],"consists":[31,48],"location":[34,52,69],"speed,":[37],"pick-up":[51,68,142],"drop-off":[55,77,144],"location.":[56,78],"Serving":[57],"request":[59,72,148],"means":[60],"that":[61,220,238],"car":[63,80,194],"must":[64],"first":[65],"visit":[66,75],"then":[74],"Each":[79,88],"can":[81,90],"only":[82],"serve":[83,105,120],"at":[84],"most":[85],"c":[86],"requests.":[87],"assignment":[89],"yield":[91],"multiple":[92],"different":[93],"serving":[94,98],"routes":[95],"corresponding":[97],"times,":[99],"our":[101],"goal":[102],"was":[103],"maximum":[107,122],"with":[111,126],"minimum":[113,128],"travel":[114],"time":[115],"(called":[116,131],"CSsum)":[117],"total":[129],"latency":[130],"CSlat).":[132],"In":[133,201],"addition,":[134],"studied":[136],"special":[138,190],"case":[139,191],"where":[140,192],"locations":[145],"coincide.":[149],"Both":[150],"problems":[151],"CSsum":[152,176,247],"CSlat":[154],"APX-hard":[156],"when":[157],"c\u22652.":[158],"We":[159,186,236],"propose":[160],"an":[161],"algorithm,":[162,209],"called":[163,210],"transportation":[165],"algorithm":[166,174,213,219],"(TA),":[167],"is":[169,241],"(2c\u22121)-approximation":[171],"(resp.":[172,177,244,248],"c-approximation)":[173],"for":[175,246],"CSlat);":[178],"these":[179,251],"bounds":[180],"shown":[182],"be":[184],"tight.":[185],"also":[187],"considered":[188],"serves":[195],"exactly":[196],"two":[197,226],"requests,":[198],"i.e.,":[199],"c=2.":[200],"addition":[202],"TA,":[205],"investigated":[207],"another":[208],"match-and-assign":[212],"(MA).":[214],"Moreover,":[215],"call":[217],"outputs":[221],"best":[223],"solutions":[227],"found":[228],"TA":[231,263],"MA":[233],"CA.":[235],"show":[237],"CA":[240],"two-approximation":[243],"5/3)":[245],"CSlat),":[249],"ratios":[252,257],"better":[254],"than":[255],"individual":[260],"algorithms,":[261],"MA.":[265]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}