{"id":"https://openalex.org/W7154478666","doi":"https://doi.org/10.48550/arxiv.2604.13013","title":"Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem","display_name":"Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem","publication_year":2026,"publication_date":"2026-04-14","ids":{"openalex":"https://openalex.org/W7154478666","doi":"https://doi.org/10.48550/arxiv.2604.13013"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13013","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":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.2604.13013","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058959557","display_name":"Yinghao Qin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qin, Yinghao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045386678","display_name":"Mosab Bazargani","orcid":"https://orcid.org/0000-0002-6555-7200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bazargani, Mosab","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128778934","display_name":"Edmund K. Burke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Burke, Edmund K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133642045","display_name":"Carlos A. Coello Coello","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Coello, Carlos A. Coello","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133705735","display_name":"Zhongmin Song","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Song, Zhongmin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100450210","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0002-6946-3623"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Jun","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.9894999861717224,"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.9894999861717224,"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.0008999999845400453,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.000699999975040555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7746000289916992},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.6424999833106995},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6243000030517578},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5810999870300293},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4812000095844269},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4715000092983246},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.44609999656677246}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7746000289916992},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7125999927520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6618000268936157},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.6424999833106995},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6243000030517578},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4812000095844269},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4715000092983246},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.44609999656677246},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4293000102043152},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C2776422217","wikidata":"https://www.wikidata.org/wiki/Q13629441","display_name":"Electric vehicle","level":3,"score":0.319599986076355},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.28540000319480896},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2621000111103058}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13013","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.13013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13013","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4557952880859375}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"tackles":[2],"the":[3,26,39,44,78,91,137,145,149,153,156,170,173],"Electric":[4],"Capacitated":[5],"Vehicle":[6],"Routing":[7],"Problem":[8],"(E-CVRP)":[9],"through":[10,61],"a":[11,35,108,162,188],"bilevel":[12,50,175],"optimization":[13],"framework":[14,176],"that":[15,59,96],"handles":[16],"routing":[17,185],"and":[18,46,68,86,119,148,177],"charging":[19],"decisions":[20],"separately":[21],"or":[22,100],"jointly":[23],"depending":[24],"on":[25,90,116,125],"search":[27,45],"stage.":[28],"By":[29],"analyzing":[30],"their":[31],"interaction,":[32],"we":[33],"introduce":[34],"surrogate":[36,146,157],"objective":[37,147,158],"at":[38],"upper":[40],"level":[41],"to":[42],"guide":[43],"accelerate":[47],"convergence.":[48],"A":[49],"Late":[51],"Acceptance":[52],"Hill":[53],"Climbing":[54],"algorithm":[55],"(b-LAHC)":[56],"is":[57],"introduced":[58],"operates":[60,73],"three":[62],"phases:":[63],"greedy":[64],"descent,":[65],"neighborhood":[66],"exploration,":[67],"final":[69],"solution":[70,164],"refinement.":[71],"b-LAHC":[72,97],"with":[74,187],"fixed":[75,109],"parameters,":[76],"eliminating":[77],"need":[79],"for":[80,181],"complex":[81],"adaptation":[82],"while":[83,159],"remaining":[84],"lightweight":[85],"effective.":[87],"Extensive":[88],"experiments":[89],"IEEE":[92],"WCCI-2020":[93],"benchmark":[94],"show":[95],"achieves":[98],"superior":[99],"competitive":[101],"performance":[102],"against":[103],"eight":[104],"state-of-the-art":[105],"algorithms.":[106],"Under":[107],"evaluation":[110],"budget,":[111],"it":[112],"attains":[113],"near-optimal":[114],"solutions":[115],"small-scale":[117],"instances":[118],"sets":[120],"9/10":[121],"new":[122],"best-known":[123],"results":[124],"large-scale":[126,184],"benchmarks,":[127],"improving":[128],"existing":[129],"records":[130],"by":[131],"an":[132],"average":[133],"of":[134,155,165,172],"1.07%.":[135],"Moreover,":[136],"strong":[138],"correlation":[139],"(though":[140],"not":[141],"universal)":[142],"observed":[143],"between":[144],"complete":[150],"cost":[151],"justifies":[152],"use":[154],"still":[160],"necessitating":[161],"joint":[163],"both":[166],"levels,":[167],"thereby":[168],"validating":[169],"effectiveness":[171],"proposed":[174],"highlighting":[178],"its":[179],"potential":[180],"efficiently":[182],"solving":[183],"problems":[186],"hierarchical":[189],"structure.":[190]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-16T00:00:00"}