{"id":"https://openalex.org/W4411600513","doi":"https://doi.org/10.1109/cec65147.2025.11043000","title":"A Hybrid Granular Ball-Ant Colony Optimization for the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem","display_name":"A Hybrid Granular Ball-Ant Colony Optimization for the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4411600513","doi":"https://doi.org/10.1109/cec65147.2025.11043000"},"language":"en","primary_location":{"id":"doi:10.1109/cec65147.2025.11043000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-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":"https://openalex.org/A5107941954","display_name":"Yuehai Xu","orcid":"https://orcid.org/0009-0008-3733-1184"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Yingkai Xu","raw_affiliation_strings":["Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania"],"affiliations":[{"raw_affiliation_string":"Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008401832","display_name":"Anik\u00f3 Kopacz","orcid":"https://orcid.org/0000-0001-5300-9955"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Anik\u00f3 Kopacz","raw_affiliation_strings":["Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania"],"affiliations":[{"raw_affiliation_string":"Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009798916","display_name":"Camelia Chira","orcid":"https://orcid.org/0000-0002-1949-1298"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Camelia Chira","raw_affiliation_strings":["Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania"],"affiliations":[{"raw_affiliation_string":"Babes-Bolyai University,Department of Computer Science,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5107941954"],"corresponding_institution_ids":["https://openalex.org/I3125347698"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24181618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9919000267982483,"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.9919000267982483,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9868999719619751,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9758999943733215,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7592595815658569},{"id":"https://openalex.org/keywords/depot","display_name":"Depot","score":0.7446064949035645},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5657671689987183},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5191263556480408},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5063852071762085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49615201354026794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.430078387260437},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4147539436817169},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3351132571697235},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1703997254371643},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1614166498184204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14084464311599731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11340120434761047},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06047755479812622}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7592595815658569},{"id":"https://openalex.org/C2776561332","wikidata":"https://www.wikidata.org/wiki/Q5554853","display_name":"Depot","level":2,"score":0.7446064949035645},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5657671689987183},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5191263556480408},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5063852071762085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49615201354026794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.430078387260437},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4147539436817169},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3351132571697235},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1703997254371643},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1614166498184204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14084464311599731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11340120434761047},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06047755479812622},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec65147.2025.11043000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2112094258","https://openalex.org/W2153676086","https://openalex.org/W2262276395","https://openalex.org/W2624708295","https://openalex.org/W2908436867","https://openalex.org/W3121980869","https://openalex.org/W3196485901","https://openalex.org/W4211130072","https://openalex.org/W4280563598","https://openalex.org/W4283524555","https://openalex.org/W4285168315","https://openalex.org/W4323044847","https://openalex.org/W4323782864","https://openalex.org/W4381095295","https://openalex.org/W4385757408","https://openalex.org/W4388199003","https://openalex.org/W4391275764","https://openalex.org/W4402289294"],"related_works":["https://openalex.org/W4245157707","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2017411971","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W2172069777","https://openalex.org/W2956620057","https://openalex.org/W2384341213","https://openalex.org/W1997193297"],"abstract_inverted_index":{"Electric":[0,23,35],"vehicles":[1],"(EVs)":[2],"are":[3,108],"increasingly":[4],"utilized":[5,97],"in":[6,146],"logistics":[7,49],"and":[8,15,40,45,142],"distribution":[9,46,68,144],"to":[10,21,42,59,61,75,98,101],"expedite":[11],"achieving":[12],"carbon":[13],"peaking":[14],"neutrality":[16],"goals,":[17],"drawing":[18],"considerable":[19],"attention":[20],"the":[22,31,62,77,86,114,122,134],"Vehicle":[24,36],"Routing":[25,37],"Problem":[26,38],"(EVRP).":[27],"This":[28,51],"study":[29],"investigates":[30],"Multi-Depot":[32],"Half-Open":[33],"Time-Dependent":[34],"(MDHOTDEVRP)":[39],"aims":[41],"improve":[43],"coordination":[44],"efficiency":[47],"among":[48],"depots.":[50],"problem":[52],"involves":[53],"multiple":[54,111],"depots,":[55],"with":[56,85,113,148],"EVs":[57],"allowed":[58],"return":[60],"nearest":[63],"depot":[64],"after":[65],"completing":[66],"their":[67],"tasks.":[69],"We":[70],"propose":[71],"a":[72],"hybrid":[73],"method":[74],"solve":[76],"MDHOTDEVRP":[78],"by":[79],"integrating":[80],"granular":[81],"ball":[82],"(GB)":[83],"computing":[84],"Ant":[87],"Colony":[88],"Optimization":[89],"(ACO)":[90],"algorithm.":[91],"Firstly,":[92],"enhanced":[93],"k-means":[94],"clustering":[95],"is":[96],"allocate":[99],"customers":[100,104],"EVs.":[102],"Then,":[103],"within":[105,127],"each":[106,128],"cluster":[107],"subdivided":[109],"into":[110],"GBs,":[112],"paths":[115],"of":[116],"these":[117],"GBs":[118],"being":[119],"scheduled.":[120],"Finally,":[121],"ACO":[123],"algorithm":[124,137],"establishes":[125],"routes":[126,145],"GB.":[129],"Experimental":[130],"results":[131],"indicate":[132],"that":[133],"proposed":[135],"GB-ACO":[136],"efficiently":[138],"allocates":[139],"charging":[140],"stations":[141],"plans":[143],"scenarios":[147],"clustered":[149],"distributions.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}