{"id":"https://openalex.org/W7172025940","doi":"https://doi.org/10.48550/arxiv.2607.27727","title":"A Graph Matching Based Approach for the Multi-Depot Capacitated Vehicle Routing Problem","display_name":"A Graph Matching Based Approach for the Multi-Depot Capacitated Vehicle Routing Problem","publication_year":2026,"publication_date":"2026-07-30","ids":{"openalex":"https://openalex.org/W7172025940","doi":"https://doi.org/10.48550/arxiv.2607.27727"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.27727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.27727","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132613925","display_name":"Jayant Chandwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chandwani, Jayant","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144165912","display_name":"Pranav M R","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R, Pranav M","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144106690","display_name":"Anand Jat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jat, Anand","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144149412","display_name":"Anshu Ostwal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ostwal, Anshu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102950882","display_name":"Diptendu Chatterjee","orcid":"https://orcid.org/0000-0002-6502-8333"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chatterjee, Diptendu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5144159638","display_name":"Anand Narasimhamurthy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narasimhamurthy, Anand","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.9904000163078308,"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.9904000163078308,"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.0019000000320374966,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6065999865531921},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48420000076293945},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4828000068664551},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46230000257492065},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39980000257492065},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.3481000065803528},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.31790000200271606}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6065999865531921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5823000073432922},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5472999811172485},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48420000076293945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4828000068664551},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46230000257492065},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39980000257492065},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3481000065803528},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29409998655319214},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28349998593330383},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.27727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.27727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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],"Multi-Depot":[1],"Capacitated":[2],"Vehicle":[3],"Routing":[4],"Problem":[5],"(MDCVRP)":[6],"asks":[7],"for":[8,53,83,100],"minimum-cost":[9],"delivery":[10],"tours":[11,84],"from":[12],"several":[13],"capacitated":[14],"depots":[15,147],"to":[16,68,87,162],"a":[17,48,69,78,113,136,176],"set":[18],"of":[19,44,71,85,103,116,142,165,170,174],"customers.":[20],"Like":[21],"most":[22],"vehicle-routing":[23],"variants":[24],"it":[25],"is":[26,75],"NP-hard,":[27],"so":[28,131],"practical":[29],"solvers":[30,183],"must":[31],"trade":[32],"solution":[33],"quality":[34,138],"against":[35,172],"speed.":[36],"We":[37,80],"revisit":[38],"this":[39],"trade-off":[40],"through":[41],"the":[42,54,90,94,119,127,132,192],"lens":[43],"graph":[45],"matching.":[46],"Adapting":[47],"matching-based":[49],"construction":[50],"first":[51],"developed":[52],"Traveling":[55],"Tournament":[56],"Problem,":[57],"we":[58],"present":[59],"two":[60,88,161],"algorithms,":[61],"Cluster-First":[62,187],"and":[63,105,145,181],"Match-First,":[64],"that":[65,82,106,154],"reduce":[66],"routing":[67],"sequence":[70],"minimum-weight":[72],"matchings.":[73],"This":[74,122],"more":[76],"than":[77],"heuristic.":[79],"prove":[81],"up":[86],"targets":[89],"matching":[91,123],"formulation":[92],"solves":[93],"MDCVRP":[95],"exactly":[96],"in":[97,118,156,168],"polynomial":[98],"time":[99],"any":[101],"number":[102],"depots,":[104],"both":[107],"algorithms":[108],"are":[109],"constant-factor":[110],"approximations,":[111],"with":[112,126],"tight":[114],"factor":[115],"two,":[117],"structured":[120],"regimes.":[121],"optimum":[124],"coincides":[125],"exact":[128,180],"combinatorial-auction":[129],"optimum,":[130],"auction":[133],"serves":[134],"as":[135],"strong":[137],"baseline.":[139],"On":[140],"instances":[141],"1000":[143],"customers":[144,199],"20":[146],"our":[148],"methods":[149],"match":[150],"or":[151],"slightly":[152],"beat":[153],"baseline":[155],"tour":[157],"length":[158],"while":[159],"running":[160],"three":[163],"orders":[164],"magnitude":[166],"faster,":[167],"tens":[169,173],"milliseconds":[171],"seconds,":[175],"scale":[177],"at":[178],"which":[179],"auction-based":[182],"become":[184],"impractical.":[185],"Because":[186],"routes":[188],"each":[189],"depot":[190],"independently,":[191],"approach":[193],"also":[194],"re-routes":[195],"cheaply":[196],"when":[197],"new":[198],"arrive.":[200]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-08-01T00:00:00"}