{"id":"https://openalex.org/W7126178565","doi":"https://doi.org/10.48550/arxiv.2601.21660","title":"Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem","display_name":"Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem","publication_year":2026,"publication_date":"2026-01-29","ids":{"openalex":"https://openalex.org/W7126178565","doi":"https://doi.org/10.48550/arxiv.2601.21660"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.21660","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.9883999824523926,"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.9883999824523926,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.0015999999595806003,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.715399980545044},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7085999846458435},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6736000180244446},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6377000212669373},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5378999710083008},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5309000015258789},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5091000199317932},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.30959999561309814}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.715399980545044},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7085999846458435},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6736000180244446},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6377000212669373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5551000237464905},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5378999710083008},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5309000015258789},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5271000266075134},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5091000199317932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33869999647140503},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.21660","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.21660","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.21660","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.21660","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,39,113,162,188],"capacitated":[1],"vehicle":[2,59,171,193],"routing":[3],"problem":[4],"(CVRP)":[5],"is":[6,41,78,182,209],"one":[7],"of":[8,28,46,88,145,169,178,186,200,213,233],"the":[9,53,57,61,74,82,86,102,108,143,167,183,210,231],"most":[10],"extensively":[11],"studied":[12],"problems":[13],"in":[14,35],"combinatorial":[15],"optimization.":[16],"In":[17,153],"this":[18,154],"problem,":[19],"we":[20,156],"are":[21,71],"given":[22],"a":[23,26,32,36,44,96,122,139,203,227],"depot":[24,62],"and":[25,50,73,148,173,195,236],"set":[27,45],"customers,":[29,66],"each":[30,48,89],"with":[31],"demand,":[33],"embedded":[34],"metric":[37,109],"space.":[38],"objective":[40],"to":[42,63],"find":[43],"tours,":[47],"starting":[49],"ending":[51],"at":[52,60],"depot,":[54],"operated":[55],"by":[56,95,138,226],"capacititated":[58],"serve":[64],"all":[65,69],"such":[67],"that":[68],"customers":[70],"served,":[72],"total":[75],"travel":[76],"cost":[77],"minimized.":[79],"We":[80],"consider":[81],"unplittable":[83],"variant,":[84],"where":[85,180,207],"demand":[87],"customer":[90],"must":[91],"be":[92,135,223],"served":[93],"entirely":[94],"single":[97],"tour.":[98],"Let":[99],"$\u03b1$":[100],"denote":[101],"current":[103],"best-known":[104],"approximation":[105,116,160,176,198],"ratio":[106,117,177,199],"for":[107,121,202],"traveling":[110],"salesman":[111],"problem.":[112],"previous":[114],"best":[115],"was":[118],"$\u03b1+1+\\ln":[119],"2+\u03b4<3.1932$":[120],"small":[123,140,204,228],"constant":[124,141,205,229],"$\u03b4>0$":[125],"(Friggstad":[126],"et":[127],"al.,":[128],"Math.":[129],"Oper.":[130],"Res.":[131],"2025),":[132],"which":[133],"can":[134,222],"further":[136,224],"improved":[137,159,225],"using":[142,230],"result":[144,232],"Blauth,":[146,234],"Traub,":[147,235],"Vygen":[149,237],"(Math.":[150,238],"Program.":[151,239],"2023).":[152,240],"paper,":[155],"propose":[157],"two":[158],"algorithms.":[161],"first":[163],"algorithm":[164,190],"focuses":[165],"on":[166],"case":[168],"fixed":[170],"capacity":[172,194],"achieves":[174,196],"an":[175,197],"$\u03b1+1+\\ln\\bigl(2-\\frac{1}{2}y_0\\bigr)<3.0897$,":[179],"$y_0>0.39312$":[181],"unique":[184,211],"root":[185,212],"$\\ln\\bigl(2-\\frac{1}{2}y\\bigr)=\\frac{3}{2}y$.":[187],"second":[189],"considers":[191],"general":[192],"$\u03b1+1+y_1+\\ln\\left(2-2y_1\\right)+\u03b4<3.1759$":[201],"$\u03b4>0$,":[206],"$y_1>0.17458$":[208],"$\\frac{1}{2}":[214],"y_1+":[215],"6":[216],"(1-y_1)\\bigl(1-e^{-\\frac{1}{2}":[217],"y_1}\\bigr)":[218],"=\\ln\\left(2-2y_1\\right)$.":[219],"Both":[220],"approximations":[221]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-01T00:00:00"}