{"id":"https://openalex.org/W4411600279","doi":"https://doi.org/10.1109/cec65147.2025.11043122","title":"A Dual-population Evolutionary Algorithm for Multi-objective Vehicle Routing Problems with Three Dimensional Loading Constraints","display_name":"A Dual-population Evolutionary Algorithm for Multi-objective Vehicle Routing Problems with Three Dimensional Loading Constraints","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4411600279","doi":"https://doi.org/10.1109/cec65147.2025.11043122"},"language":"en","primary_location":{"id":"doi:10.1109/cec65147.2025.11043122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043122","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/A5072506119","display_name":"Quan Zhou","orcid":"https://orcid.org/0000-0003-1547-3065"},"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":true,"raw_author_name":"Quan Zhou","raw_affiliation_strings":["Anhui University,School of Artificial Intelligence,Hefei,China"],"affiliations":[{"raw_affiliation_string":"Anhui University,School of Artificial Intelligence,Hefei,China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080976966","display_name":"Jinglong Gao","orcid":"https://orcid.org/0000-0002-4466-0516"},"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":"Jinglong Gao","raw_affiliation_strings":["Anhui University,School of Computer Science and Technology,Hefei,China"],"affiliations":[{"raw_affiliation_string":"Anhui University,School of Computer Science and Technology,Hefei,China","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100712105","display_name":"Hao Jiang","orcid":"https://orcid.org/0000-0002-6769-0785"},"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":["Anhui University,School of Computer Science and Technology,Hefei,China"],"affiliations":[{"raw_affiliation_string":"Anhui University,School of Computer Science and Technology,Hefei,China","institution_ids":["https://openalex.org/I143868143"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072506119"],"corresponding_institution_ids":["https://openalex.org/I143868143"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24163257,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9825000166893005,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9825000166893005,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9815000295639038,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9420999884605408,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.7336458563804626},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7032527923583984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6505520343780518},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5703151822090149},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.507422149181366},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5048890709877014},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.486218124628067},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4603445827960968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4027251601219177},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22030770778656006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18236833810806274},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16266858577728271}],"concepts":[{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7336458563804626},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7032527923583984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6505520343780518},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5703151822090149},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.507422149181366},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5048890709877014},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.486218124628067},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4603445827960968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4027251601219177},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22030770778656006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18236833810806274},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16266858577728271},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec65147.2025.11043122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043122","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":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W80900748","https://openalex.org/W1990902176","https://openalex.org/W2024008967","https://openalex.org/W2038420231","https://openalex.org/W2043735779","https://openalex.org/W2081708500","https://openalex.org/W2086453346","https://openalex.org/W2088314713","https://openalex.org/W2103862045","https://openalex.org/W2126475333","https://openalex.org/W2136521496","https://openalex.org/W2140899050","https://openalex.org/W2884885225","https://openalex.org/W3035506427","https://openalex.org/W3136908367","https://openalex.org/W4200113658","https://openalex.org/W4223656511","https://openalex.org/W4285286335","https://openalex.org/W4293051497","https://openalex.org/W4380738781","https://openalex.org/W6770081585"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875","https://openalex.org/W2802808995","https://openalex.org/W2787833928"],"abstract_inverted_index":{"The":[0],"Capacitated":[1,19],"Vehicle":[2,20],"Routing":[3,21],"Problems":[4,23],"with":[5],"Three-Dimensional":[6],"Loading":[7],"Constraints":[8],"(3L-CVRPs)":[9],"present":[10],"significantly":[11],"greater":[12],"complexities":[13],"when":[14],"compared":[15],"to":[16,32,45,52,117,124,144],"the":[17,30,68,76,100,130,158],"classical":[18],"Optimization":[22],"(CVRPs).":[24],"This":[25,107],"heightened":[26],"complexity":[27,70],"stems":[28],"from":[29],"necessity":[31],"simultaneously":[33],"address":[34],"two":[35,105,138],"intertwined":[36],"objectives:":[37],"optimizing":[38],"vehicle":[39,54,126],"routing":[40,127],"and":[41,59,169],"cargo":[42],"loading":[43,47,96,135,167],"configurations":[44],"maximize":[46],"efficiency,":[48],"all":[49],"while":[50],"adhering":[51],"stringent":[53],"dimensional":[55],"constraints":[56],"(length,":[57],"width,":[58],"height).":[60],"Both":[61],"of":[62,72,79],"these":[63,104],"subproblems":[64],"are":[65],"recognized":[66],"within":[67],"computational":[69],"class":[71],"NP-hard":[73],"problems.":[74],"Despite":[75],"proven":[77],"efficacy":[78],"evolutionary":[80,113],"algorithms":[81],"in":[82,115],"addressing":[83],"3L-CVRPs,":[84],"prevalent":[85],"methodologies":[86],"typically":[87],"adopt":[88],"a":[89,110,141],"sequential":[90],"approach,":[91],"prioritizing":[92],"route":[93],"op-timization":[94],"over":[95],"optimization,":[97],"thereby":[98],"overlooking":[99],"intrinsic":[101],"interconnectedness":[102],"between":[103],"facets.":[106],"paper":[108],"proposes":[109],"novel":[111],"dual-population":[112],"algorithm":[114,160],"response":[116],"this":[118],"limitation.":[119],"One":[120],"population":[121],"is":[122],"dedicated":[123],"refining":[125],"solutions,":[128],"whereas":[129],"other":[131],"focuses":[132],"on":[133],"enhancing":[134],"efficiency.":[136],"These":[137],"populations":[139],"undergo":[140],"co-evolutionary":[142],"process":[143],"identify":[145],"optimal":[146],"solutions":[147],"for":[148],"3L-CVRPs.":[149],"Empirical":[150],"evaluations":[151],"across":[152],"four":[153],"diverse":[154],"datasets":[155],"reveal":[156],"that":[157],"proposed":[159],"surpasses":[161],"three":[162],"contemporary":[163],"algorithms,":[164],"achieving":[165],"superior":[166],"efficiency":[168],"reduced":[170],"transportation":[171],"costs.":[172]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}