{"id":"https://openalex.org/W4315777891","doi":"https://doi.org/10.1109/icnsc55942.2022.10004081","title":"An Efficient Metaheuristic Algorithm for Solving Soft-clustered Vehicle Routing Problems","display_name":"An Efficient Metaheuristic Algorithm for Solving Soft-clustered Vehicle Routing Problems","publication_year":2022,"publication_date":"2022-12-15","ids":{"openalex":"https://openalex.org/W4315777891","doi":"https://doi.org/10.1109/icnsc55942.2022.10004081"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc55942.2022.10004081","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icnsc55942.2022.10004081","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","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":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","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/A5077735738","display_name":"Yawen Kou","orcid":"https://orcid.org/0000-0003-1670-4750"},"institutions":[{"id":"https://openalex.org/I143593769","display_name":"East China University of Science and Technology","ror":"https://ror.org/01vyrm377","country_code":"CN","type":"education","lineage":["https://openalex.org/I143593769"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yawen Kou","raw_affiliation_strings":["East China University of Science and Technology,Department of Computer Science and Engineering,Shanghai,China,200237"],"affiliations":[{"raw_affiliation_string":"East China University of Science and Technology,Department of Computer Science and Engineering,Shanghai,China,200237","institution_ids":["https://openalex.org/I143593769"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071839367","display_name":"Yangming Zhou","orcid":"https://orcid.org/0000-0002-4254-6517"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yangming Zhou","raw_affiliation_strings":["Data-Driven Management Decision Making Lab, Shanghai Jiao Tong University,Shanghai,China,200030","Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Data-Driven Management Decision Making Lab, Shanghai Jiao Tong University,Shanghai,China,200030","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081318069","display_name":"MengChu Zhou","orcid":"https://orcid.org/0000-0002-5408-8752"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]},{"id":"https://openalex.org/I111950717","display_name":"Macau University of Science and Technology","ror":"https://ror.org/03jqs2n27","country_code":"MO","type":"education","lineage":["https://openalex.org/I111950717","https://openalex.org/I4391767947"]}],"countries":["MO","US"],"is_corresponding":false,"raw_author_name":"Mengchu Zhou","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Electrical and Computer Engineering,Newark,NJ,USA,07102","Macau Institute of Systems Engineering, Macau University of Science and Technology, Macau, China"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Electrical and Computer Engineering,Newark,NJ,USA,07102","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"Macau Institute of Systems Engineering, Macau University of Science and Technology, Macau, China","institution_ids":["https://openalex.org/I111950717"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077735738"],"corresponding_institution_ids":["https://openalex.org/I143593769"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3024542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6995601654052734},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6700329184532166},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6496671438217163},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6440101861953735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5732123255729675},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5728275775909424},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5489599108695984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5075937509536743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42388254404067993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28314274549484253},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06625083088874817}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6995601654052734},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6700329184532166},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6496671438217163},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6440101861953735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5732123255729675},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5728275775909424},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5489599108695984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5075937509536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42388254404067993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28314274549484253},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06625083088874817},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc55942.2022.10004081","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icnsc55942.2022.10004081","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","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":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4369383357","display_name":null,"funder_award_id":"0047/2021/A1","funder_id":"https://openalex.org/F4320323893","funder_display_name":"Fundo para o Desenvolvimento das Ci\u00eancias e da Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320323893","display_name":"Fundo para o Desenvolvimento das Ci\u00eancias e da Tecnologia","ror":"https://ror.org/05vna4324"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2017070898","https://openalex.org/W2046280257","https://openalex.org/W2061594663","https://openalex.org/W2093795574","https://openalex.org/W2121666077","https://openalex.org/W2242266352","https://openalex.org/W2322334644","https://openalex.org/W2586188487","https://openalex.org/W2597991082","https://openalex.org/W2793006232","https://openalex.org/W2916932176","https://openalex.org/W2963130633","https://openalex.org/W3005272590","https://openalex.org/W3034038218","https://openalex.org/W3046197868","https://openalex.org/W3107277677","https://openalex.org/W3121330861","https://openalex.org/W3175367341","https://openalex.org/W3215977601","https://openalex.org/W4211023400","https://openalex.org/W4214813201","https://openalex.org/W6683466594"],"related_works":["https://openalex.org/W2996796639","https://openalex.org/W2972305535","https://openalex.org/W1538016805","https://openalex.org/W2384925093","https://openalex.org/W1992742448","https://openalex.org/W1521890650","https://openalex.org/W2998423674","https://openalex.org/W1519721544","https://openalex.org/W2013564586","https://openalex.org/W2010567643"],"abstract_inverted_index":{"A":[0],"soft-clustered":[1],"vehicle":[2,14],"routing":[3,15],"problem":[4],"(SoftClu-VRP)":[5],"is":[6,49],"an":[7,56,65],"important":[8],"variant":[9],"of":[10,26,106],"the":[11,27,34,127],"well-known":[12],"capacitated":[13],"problem,":[16],"where":[17],"customers":[18,25],"are":[19],"partitioned":[20],"into":[21],"clusters":[22],"and":[23,92],"all":[24],"same":[28,35],"<sup>c</sup>lust<sup>er</sup>":[29],"must":[30],"be":[31],"served":[32],"by":[33,70],"vehicle.":[36],"As":[37],"a":[38,72,78,82,88,93,99],"highly":[39,115],"useful":[40],"model":[41],"for":[42,60],"parcel":[43],"delivery":[44],"in":[45],"courier":[46],"companies,":[47],"SoftCluVRP":[48],"NP-hard.":[50],"In":[51,122],"this":[52],"work,":[53],"we":[54],"propose":[55],"efficient":[57],"metaheuristic":[58],"algorithm":[59,125],"solving":[61],"it.":[62],"Starting":[63],"from":[64],"initial":[66],"population,":[67],"it":[68,113],"iterates":[69],"using":[71],"solution":[73],"recombination":[74],"operator":[75],"(to":[76,86,97],"generate":[77],"promising":[79],"offspring":[80],"solution),":[81],"hybrid":[83],"neighborhood":[84],"search":[85],"find":[87],"high-quality":[89],"local":[90],"optimum),":[91],"population":[94],"updating":[95],"strategy":[96],"manage":[98],"healthy":[100],"population).":[101],"Experiments":[102],"on":[103,131],"two":[104],"groups":[105],"378":[107],"widely-used":[108],"benchmark":[109],"instances":[110],"show":[111],"that":[112],"achieves":[114],"competitive":[116],"performance":[117],"compared":[118],"to":[119],"state-of-the-art":[120],"algorithms.":[121],"particular,":[123],"our":[124],"finds":[126],"best":[128],"upper":[129],"bounds":[130],"320":[132],"instances.":[133]},"counts_by_year":[],"updated_date":"2025-12-23T23:11:35.936235","created_date":"2025-10-10T00:00:00"}