{"id":"https://openalex.org/W4401202287","doi":"https://doi.org/10.1145/3638530.3654333","title":"PEACH: A Multi-Objective Evolutionary Algorithm for Complex Vehicle Routing with Three-Dimensional Loading Constraints","display_name":"PEACH: A Multi-Objective Evolutionary Algorithm for Complex Vehicle Routing with Three-Dimensional Loading Constraints","publication_year":2024,"publication_date":"2024-07-14","ids":{"openalex":"https://openalex.org/W4401202287","doi":"https://doi.org/10.1145/3638530.3654333"},"language":"en","primary_location":{"id":"doi:10.1145/3638530.3654333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638530.3654333","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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/A5101640335","display_name":"Han Zhang","orcid":"https://orcid.org/0000-0001-8243-1135"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]},{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN","HK"],"is_corresponding":true,"raw_author_name":"Han Zhang","raw_affiliation_strings":["Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China","Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]},{"raw_affiliation_string":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100404176","display_name":"Qing Li","orcid":"https://orcid.org/0000-0003-3370-471X"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Qing Li","raw_affiliation_strings":["Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["Department of Computing and Decision Science, Lingnan University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Decision Science, Lingnan University, Hong Kong, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101640335"],"corresponding_institution_ids":["https://openalex.org/I14243506","https://openalex.org/I3045169105"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19877676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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.998199999332428,"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.9972000122070312,"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.9890999794006348,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7465603351593018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6118302941322327},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.479265421628952},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.46311038732528687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44649094343185425},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4056618809700012},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2149553894996643},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1810101568698883},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15614193677902222}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7465603351593018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6118302941322327},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.479265421628952},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.46311038732528687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44649094343185425},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4056618809700012},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2149553894996643},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1810101568698883},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15614193677902222}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638530.3654333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638530.3654333","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3602883075","display_name":null,"funder_award_id":"Grant No. 62250710682","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":11,"referenced_works":["https://openalex.org/W1978338991","https://openalex.org/W2002914572","https://openalex.org/W2052200555","https://openalex.org/W2126105956","https://openalex.org/W2155262811","https://openalex.org/W2594089497","https://openalex.org/W2883598186","https://openalex.org/W2976056797","https://openalex.org/W2978184063","https://openalex.org/W3080119422","https://openalex.org/W3170601965"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W2051487156","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2073681303","https://openalex.org/W2157331354","https://openalex.org/W2887328214"],"abstract_inverted_index":{"The":[0],"Split":[1],"Delivery":[2],"Vehicle":[3],"Routing":[4],"Problem":[5],"with":[6,16,34,84,94,139],"Three-Dimensional":[7],"Loading":[8],"Constraints":[9],"(3L-SDVRP)":[10],"combines":[11],"routing":[12],"and":[13,22,44,65,89,143,154],"packing":[14],"challenges":[15],"two":[17,95],"objectives":[18],"(minimizing":[19],"travel":[20],"distance":[21],"maximizing":[23],"vehicle":[24],"loading":[25],"rate).":[26],"Meta-heuristic":[27],"algorithms":[28],"are":[29],"effective":[30,49],"in":[31,55,176],"addressing":[32],"3L-SDVRP,":[33],"the":[35,69,145],"balance":[36,62],"between":[37,63],"exploration":[38,64],"(searching":[39],"broadly":[40],"for":[41,124,137],"new":[42,100],"solutions)":[43,50],"exploitation":[45],"(focusing":[46],"near":[47],"known":[48],"playing":[51],"a":[52,80,99,117],"pivotal":[53],"role":[54],"their":[56],"performance.":[57],"However,":[58],"achieving":[59],"an":[60,74],"optimal":[61],"exploitation,":[66],"especially":[67],"within":[68],"limited":[70],"computational":[71],"resources,":[72],"remains":[73],"ongoing":[75],"challenge.":[76],"This":[77,106],"paper":[78],"introduces":[79],"Pareto-based":[81],"Evolutionary":[82],"Algorithm":[83],"Concurrent":[85],"execution":[86],"of":[87],"crossover":[88,153],"Hierarchical":[90],"neighborhood":[91,102,110],"mutation":[92,103,107,129,136,155],"(PEACH)":[93],"novel":[96],"features.":[97],"Firstly,":[98],"hierarchical":[101,131],"is":[104,130],"proposed.":[105],"employs":[108],"multiple":[109],"structures":[111],"to":[112,160],"produce":[113],"diverse":[114],"offspring":[115],"from":[116],"single":[118],"parent,":[119],"thus":[120],"increasing":[121],"solution":[122],"diversity":[123],"better":[125],"exploitation.":[126],"Additionally,":[127],"our":[128],"rather":[132,167],"than":[133,168],"random,":[134],"prioritizing":[135],"individuals":[138],"higher":[140],"nondomination":[141],"ranks":[142],"guiding":[144],"search":[146],"towards":[147],"promising":[148],"regions.":[149],"Secondly,":[150],"PEACH":[151],"applies":[152],"concurrently,":[156],"allowing":[157],"each":[158],"individual":[159],"undergo":[161],"either":[162],"or":[163],"both":[164],"processes":[165],"simultaneously,":[166],"sequentially.":[169],"Our":[170],"experimental":[171],"results":[172],"demonstrate":[173],"PEACH's":[174],"effectiveness":[175],"tackling":[177],"3L-SDVRP.":[178]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}