{"id":"https://openalex.org/W7126248919","doi":"https://doi.org/10.48550/arxiv.2601.21652","title":"Improved Approximations for Dial-a-Ride Problems","display_name":"Improved Approximations for Dial-a-Ride Problems","publication_year":2026,"publication_date":"2026-01-29","ids":{"openalex":"https://openalex.org/W7126248919","doi":"https://doi.org/10.48550/arxiv.2601.21652"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.21652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124448013","display_name":"Jingyang Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Jingyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114975659","display_name":"Mingyu Xiao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao, Mingyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11942","display_name":"Transportation and Mobility Innovations","score":0.007400000002235174,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7189000248908997},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5267999768257141},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5062999725341797},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.46540001034736633},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4595000147819519},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.4187000095844269},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.34619998931884766},{"id":"https://openalex.org/keywords/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7189000248908997},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5101000070571899},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5062999725341797},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.46540001034736633},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44999998807907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4271000027656555},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.4187000095844269},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.30979999899864197},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2989000082015991},{"id":"https://openalex.org/C2986878899","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical approximation","level":3,"score":0.29510000348091125},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.2786000072956085},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C142311740","wikidata":"https://www.wikidata.org/wiki/Q1066177","display_name":"Shaping","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.21652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.21652","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.21652","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.21652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,79],"multi-vehicle":[1],"dial-a-ride":[2],"problem":[3,10],"(mDaRP)":[4],"is":[5,52],"a":[6,23,45,48],"fundamental":[7],"vehicle":[8,70],"routing":[9],"with":[11,104],"pickups":[12],"and":[13,20,38,47,108],"deliveries,":[14],"widely":[15],"applicable":[16],"in":[17],"ride-sharing,":[18],"economics,":[19],"transportation.":[21],"Given":[22],"set":[24],"of":[25,30,101,115,119,125,153],"$n$":[26],"locations,":[27],"$h$":[28],"vehicles":[29],"identical":[31],"capacity":[32],"$\u03bb$":[33,74],"located":[34],"at":[35,76],"various":[36],"depots,":[37],"$m$":[39],"ride":[40],"requests":[41,60],"each":[42],"defined":[43],"by":[44,135,161],"source":[46],"destination,":[49],"the":[50,63,84,94,97,109,131,148,156],"goal":[51],"to":[53],"plan":[54],"non-preemptive":[55],"routes":[56],"that":[57,68],"serve":[58],"all":[59],"while":[61],"minimizing":[62],"total":[64],"travel":[65],"distance,":[66],"ensuring":[67],"no":[69],"carries":[71],"more":[72],"than":[73],"passengers":[75],"any":[77],"time.":[78],"best-known":[80,150],"approximation":[81,99,113,123,151],"ratio":[82,100,114,124,152],"for":[83,130,155],"mDaRP":[85],"remains":[86],"$\\mathcal{O}(\\sqrt\u03bb\\log":[87,102],"m)$.":[88],"We":[89],"propose":[90],"two":[91],"simple":[92],"algorithms:":[93],"first":[95],"achieves":[96],"same":[98],"m)$":[103],"improved":[105],"running":[106],"time,":[107],"second":[110],"attains":[111],"an":[112,122,141],"$\\mathcal{O}(\\sqrt{\\frac{m}\u03bb})$.":[116],"A":[117],"combination":[118],"them":[120],"yields":[121],"$\\mathcal{O}(\\sqrt[4]{n}\\log^{\\frac{1}{2}}n)$":[126],"under":[127],"$m=\u0398(n)$.":[128],"Moreover,":[129],"case":[132],"$m\\gg":[133],"n$,":[134],"extending":[136],"our":[137],"algorithms,":[138],"we":[139],"derive":[140],"$\\mathcal{O}(\\sqrt{n\\log":[142],"n})$-approximation":[143],"algorithm,":[144],"which":[145],"also":[146],"improves":[147],"current":[149],"$\\mathcal{O}(\\sqrt{n}\\log^2n)$":[154],"classic":[157],"(single-vehicle)":[158],"DaRP,":[159],"obtained":[160],"Gupta":[162],"et":[163],"al.":[164],"(ACM":[165],"Trans.":[166],"Algorithms,":[167],"2010).":[168]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-01T00:00:00"}