{"id":"https://openalex.org/W7131809553","doi":"https://doi.org/10.48550/arxiv.2602.23092","title":"Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design","display_name":"Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7131809553","doi":"https://doi.org/10.48550/arxiv.2602.23092"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.23092","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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/A5004771904","display_name":"Zhuoliang Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xie, Zhuoliang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127056676","display_name":"Fei Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Fei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064608174","display_name":"Zhenkun Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zhenkun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124950995","display_name":"Qingfu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Qingfu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004771904"],"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.9746999740600586,"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.9746999740600586,"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.003000000026077032,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.0024999999441206455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8356000185012817},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8251000046730042},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7289999723434448},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6682000160217285},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5609999895095825},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.49959999322891235},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4636000096797943},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.3671000003814697}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8356000185012817},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8251000046730042},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7289999723434448},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6682000160217285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6485999822616577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6216999888420105},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5609999895095825},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.49959999322891235},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36010000109672546},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2660999894142151},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.23092","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.23092","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.23092","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.23092","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4231612980365753}],"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],"Capacitated":[1],"Vehicle":[2],"Routing":[3],"Problem":[4],"(CVRP),":[5],"a":[6,53],"fundamental":[7],"combinatorial":[8],"optimization":[9],"challenge,":[10],"focuses":[11],"on":[12],"optimizing":[13],"fleet":[14],"operations":[15],"under":[16],"vehicle":[17,149],"capacity":[18],"constraints.":[19],"While":[20],"extensively":[21],"studied":[22],"in":[23,132,144],"operational":[24],"research,":[25],"the":[26,83,108,133,138,146],"NP-hard":[27],"nature":[28],"of":[29,111,129,140,148],"CVRP":[30,64],"continues":[31],"to":[32,62,75,93],"pose":[33],"significant":[34],"computational":[35,95],"challenges,":[36],"particularly":[37],"for":[38,126],"large-scale":[39,117,135],"instances.":[40,118],"This":[41],"study":[42],"presents":[43],"AILS-AHD":[44,112],"(Adaptive":[45],"Iterated":[46],"Local":[47],"Search":[48],"with":[49,73],"Automatic":[50],"Heuristic":[51],"Design),":[52],"novel":[54],"approach":[55,121],"that":[56],"leverages":[57],"Large":[58],"Language":[59],"Models":[60],"(LLMs)":[61],"revolutionize":[63],"solving.":[65],"Our":[66],"methodology":[67],"integrates":[68],"an":[69,89],"evolutionary":[70],"search":[71],"framework":[72],"LLMs":[74],"dynamically":[76],"generate":[77],"and":[78,105,116],"optimize":[79],"ruin":[80],"heuristics":[81],"within":[82],"AILS":[84],"method.":[85],"Additionally,":[86],"we":[87],"introduce":[88],"LLM-based":[90],"acceleration":[91],"mechanism":[92],"enhance":[94],"efficiency.":[96],"Comprehensive":[97],"experimental":[98],"evaluations":[99],"against":[100],"state-of-the-art":[101],"solvers,":[102],"including":[103],"AILS-II":[104],"HGS,":[106],"demonstrate":[107],"superior":[109],"performance":[110],"across":[113],"both":[114],"moderate":[115],"Notably,":[119],"our":[120],"establishes":[122],"new":[123],"best-known":[124],"solutions":[125],"8":[127],"out":[128],"10":[130],"instances":[131],"CVRPLib":[134],"benchmark,":[136],"underscoring":[137],"potential":[139],"LLM-driven":[141],"heuristic":[142],"design":[143],"advancing":[145],"field":[147],"routing":[150],"optimization.":[151]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-28T00:00:00"}