{"id":"https://openalex.org/W4415821065","doi":"https://doi.org/10.1109/tits.2025.3624831","title":"A Multifidelity-Based Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problems","display_name":"A Multifidelity-Based Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problems","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4415821065","doi":"https://doi.org/10.1109/tits.2025.3624831"},"language":null,"primary_location":{"id":"doi:10.1109/tits.2025.3624831","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2025.3624831","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chengming Wu","orcid":"https://orcid.org/0009-0008-3627-9345"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chengming Wu","raw_affiliation_strings":["Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University, Hefei, China"],"raw_orcid":"https://orcid.org/0009-0008-3627-9345","affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039480515","display_name":"Xiaoshu Xiang","orcid":"https://orcid.org/0000-0002-9107-1677"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoshu Xiang","raw_affiliation_strings":["Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Institutes of Physical Science and Information Technology, Anhui University, Hefei, China"],"raw_orcid":"https://orcid.org/0000-0002-9107-1677","affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Institutes of Physical Science and Information Technology, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110958945","display_name":"Hao Jiang","orcid":"https://orcid.org/0009-0001-8534-4130"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Jiang","raw_affiliation_strings":["Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"],"raw_orcid":"https://orcid.org/0009-0001-8534-4130","affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028634381","display_name":"Xingyi Zhang","orcid":"https://orcid.org/0000-0002-5052-000X"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xingyi Zhang","raw_affiliation_strings":["Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"],"raw_orcid":"https://orcid.org/0000-0002-5052-000X","affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China","institution_ids":["https://openalex.org/I143868143"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143868143"],"apc_list":null,"apc_paid":null,"fwci":1.2337,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.8253416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"27","issue":"1","first_page":"318","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6266000270843506,"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.6266000270843506,"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/T10768","display_name":"Electric Vehicles and Infrastructure","score":0.32829999923706055,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.003100000089034438,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7268000245094299},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6431000232696533},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6123999953269958},{"id":"https://openalex.org/keywords/electric-vehicle","display_name":"Electric vehicle","score":0.4876999855041504},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.43050000071525574},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.3682999908924103},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.3499999940395355},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.31439998745918274}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7268000245094299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6470000147819519},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6431000232696533},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6013000011444092},{"id":"https://openalex.org/C2776422217","wikidata":"https://www.wikidata.org/wiki/Q13629441","display_name":"Electric vehicle","level":3,"score":0.4876999855041504},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.43050000071525574},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.3682999908924103},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.3124000132083893},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.29679998755455017},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.28679999709129333},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.2797999978065491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2761000096797943},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.2736999988555908},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2025.3624831","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2025.3624831","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2757623951","display_name":null,"funder_award_id":"U21A20512","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6759899000","display_name":null,"funder_award_id":"62202006","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7124314820","display_name":null,"funder_award_id":"62372001","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W178407265","https://openalex.org/W1510850782","https://openalex.org/W2023284604","https://openalex.org/W2029392610","https://openalex.org/W2035231387","https://openalex.org/W2075239114","https://openalex.org/W2078619461","https://openalex.org/W2090310775","https://openalex.org/W2094764575","https://openalex.org/W2114844199","https://openalex.org/W2126598061","https://openalex.org/W2287965649","https://openalex.org/W2509755532","https://openalex.org/W2558932716","https://openalex.org/W2593704234","https://openalex.org/W2758661643","https://openalex.org/W2763090371","https://openalex.org/W2769021820","https://openalex.org/W2914011715","https://openalex.org/W2929879061","https://openalex.org/W2992709685","https://openalex.org/W2996367287","https://openalex.org/W2999829964","https://openalex.org/W3006678403","https://openalex.org/W3083445116","https://openalex.org/W3085063431","https://openalex.org/W3090234698","https://openalex.org/W3099501324","https://openalex.org/W3117777470","https://openalex.org/W3122122318","https://openalex.org/W3132134635","https://openalex.org/W3134237432","https://openalex.org/W3146106549","https://openalex.org/W3154344835","https://openalex.org/W3203981070","https://openalex.org/W3205718397","https://openalex.org/W4210713853","https://openalex.org/W4226041171","https://openalex.org/W4280563598","https://openalex.org/W4304086169","https://openalex.org/W4384080806","https://openalex.org/W4390492561","https://openalex.org/W4390604927","https://openalex.org/W4398187821"],"related_works":[],"abstract_inverted_index":{"The":[0,154],"capacitated":[1],"electric":[2,23],"vehicle":[3],"routing":[4,47,60,79,99,143,170,176],"problem":[5],"(CEVRP)":[6],"has":[7],"drawn":[8],"much":[9,64],"attention":[10],"from":[11],"researchers":[12],"in":[13,187,212,230],"the":[14,18,21,30,37,41,72,78,91,103,114,139,203,208,216],"recent":[15],"decade":[16],"against":[17],"background":[19],"of":[20,142,190,210,232],"rising":[22],"transportation":[24],"industry.":[25],"Existing":[26],"studies":[27],"have":[28],"found":[29,101],"CEVRP":[31,42,104],"more":[32],"difficult":[33],"to":[34,44,67,88,132,162,184],"address":[35],"than":[36],"typical":[38],"CVRP":[39],"since":[40],"needs":[43],"simultaneously":[45],"optimize":[46],"plans":[48,100,144,177],"and":[49,106,117,193,215,236],"charging":[50,75,94,110,135,165,197],"decisions":[51,95,111,136,166],"at":[52,151],"a":[53,58,158,227],"high":[54,152],"computational":[55,65,115,237],"budget.":[56],"Given":[57],"certain":[59],"plan,":[61],"it":[62,85],"takes":[63],"cost":[66,116],"exhaustively":[68],"or":[69],"approximately":[70],"achieve":[71],"accurate":[73,92,195],"optimal":[74,93,196],"decision":[76,191],"under":[77],"plan.":[80],"This":[81],"paper":[82],"proposes":[83],"that":[84,146,202],"is":[86,129],"unnecessary":[87],"search":[89,134,160,182,186],"for":[90,96,167,173,224],"potentially":[97,168,174],"low-quality":[98,169],"during":[102],"optimization,":[105],"instead":[107],"obtaining":[108],"acceptable":[109],"significantly":[112,219],"reduces":[113],"helps":[118],"maintain":[119],"fast":[120],"convergence.":[121],"A":[122],"multifidelity-based":[123],"ant":[124],"colony":[125],"optimization":[126],"(MFACO)":[127],"algorithm":[128],"then":[130],"proposed":[131,155,204,217],"flexibly":[133],"based":[137],"on":[138],"potential":[140],"quality":[141,235],"so":[145],"CEVRPs":[147,214],"can":[148],"be":[149],"addressed":[150],"efficiency.":[153],"MFACO":[156,178,218],"employs":[157,179],"low-fidelity":[159],"strategy":[161],"obtain":[163],"coarse":[164],"plans,":[171],"whereas":[172],"high-quality":[175],"three":[180],"high-fidelity":[181],"strategies":[183],"local":[185],"different":[188],"regions":[189],"space":[192],"provide":[194],"decisions.":[198],"Experimental":[199],"results":[200],"demonstrate":[201],"multifidelity":[205],"method":[206],"enhances":[207],"efficiency":[209],"ACO":[211],"solving":[213],"outperforms":[220],"four":[221],"state-of-the-art":[222],"algorithms":[223],"CEVRPs,":[225],"providing":[226],"competitive":[228],"performance":[229],"terms":[231],"both":[233],"solution":[234],"cost.":[238]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-11-03T00:00:00"}