{"id":"https://openalex.org/W7160614681","doi":"https://doi.org/10.48550/arxiv.2605.05208","title":"A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems","display_name":"A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7160614681","doi":"https://doi.org/10.48550/arxiv.2605.05208"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.05208","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05208","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":null,"license_id":null,"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.2605.05208","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135705734","display_name":"Zhenyu Lei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lei, Zhenyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016332970","display_name":"Jin\u2010Kao Hao","orcid":"https://orcid.org/0000-0001-8813-4377"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao, Jin-Kao","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.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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/benchmark","display_name":"Benchmark (surveying)","score":0.7282000184059143},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6308000087738037},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5954999923706055},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5598000288009644},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5070000290870667},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.4343000054359436},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4323999881744385}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7282000184059143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6816999912261963},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6308000087738037},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5954999923706055},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5598000288009644},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5070000290870667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46399998664855957},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4323999881744385},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.3935000002384186},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3068999946117401},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25850000977516174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.05208","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05208","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.05208","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05208","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Multi-depot":[0],"vehicle":[1],"routing":[2],"problems":[3],"(MDVRPs)":[4],"are":[5,15,63,116],"prevalent":[6],"in":[7,71],"a":[8,33,40,46,53,90,96],"variety":[9],"of":[10,35,83,107],"practical":[11],"applications.":[12],"However,":[13],"they":[14],"computationally":[16],"challenging":[17],"to":[18,21,65],"solve":[19],"due":[20],"their":[22],"inherent":[23],"complexity.":[24],"This":[25],"paper":[26],"proposes":[27],"an":[28,80],"effective":[29],"hybrid":[30],"algorithm":[31,38,85],"for":[32,123],"class":[34],"MDVRPs.":[36],"The":[37],"integrates":[39],"learning-driven,":[41],"diversity-controlled":[42],"route-exchange":[43],"crossover":[44],"and":[45,78],"multi-depot-supported":[47],"feasible-and-infeasible":[48],"search":[49,61,69],"framework":[50],"guided":[51],"by":[52],"multi-penalty":[54],"evaluation":[55],"function.":[56],"Two":[57],"dedicated":[58],"depot-related":[59],"local":[60],"operators":[62],"incorporated":[64],"further":[66],"strengthen":[67],"the":[68,84,113],"capability":[70],"multi-depot":[72],"settings.":[73],"To":[74],"improve":[75],"computational":[76,102],"efficiency":[77],"scalability,":[79],"enhanced":[81],"version":[82],"is":[86],"developed":[87],"that":[88,112],"uses":[89],"tensor-based":[91],"GPU":[92],"acceleration":[93],"combined":[94],"with":[95,119],"novel":[97],"multi-move":[98],"update":[99],"strategy.":[100],"Extensive":[101],"experiments":[103],"on":[104],"benchmark":[105],"instances":[106],"three":[108],"MDVRP":[109],"variants":[110],"show":[111],"proposed":[114],"algorithms":[115],"highly":[117],"competitive":[118],"state-of-the-art":[120],"methods,":[121],"especially":[122],"large-scale":[124],"instances.":[125]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-09T00:00:00"}