{"id":"https://openalex.org/W4366983274","doi":"https://doi.org/10.3233/jifs-223404","title":"A hybrid iterated local search algorithm for the multi-compartment vehicle routing problem","display_name":"A hybrid iterated local search algorithm for the multi-compartment vehicle routing problem","publication_year":2023,"publication_date":"2023-04-25","ids":{"openalex":"https://openalex.org/W4366983274","doi":"https://doi.org/10.3233/jifs-223404"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-223404","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-223404","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy 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":"https://openalex.org/A5089748607","display_name":"Yane Hou","orcid":"https://orcid.org/0000-0002-4836-0406"},"institutions":[{"id":"https://openalex.org/I173899330","display_name":"Henan University","ror":"https://ror.org/003xyzq10","country_code":"CN","type":"education","lineage":["https://openalex.org/I173899330"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan-e Hou","raw_affiliation_strings":["College of Computer and Information Engineering, Henan University, Kaifeng, China","Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Engineering, Henan University, Kaifeng, China","institution_ids":["https://openalex.org/I173899330"]},{"raw_affiliation_string":"Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng, China","institution_ids":["https://openalex.org/I173899330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100769675","display_name":"Chunxiao Wang","orcid":"https://orcid.org/0000-0002-8387-5923"},"institutions":[{"id":"https://openalex.org/I173899330","display_name":"Henan University","ror":"https://ror.org/003xyzq10","country_code":"CN","type":"education","lineage":["https://openalex.org/I173899330"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunxiao Wang","raw_affiliation_strings":["College of Computer and Information Engineering, Henan University, Kaifeng, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Engineering, Henan University, Kaifeng, China","institution_ids":["https://openalex.org/I173899330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110970856","display_name":"Congran Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I173899330","display_name":"Henan University","ror":"https://ror.org/003xyzq10","country_code":"CN","type":"education","lineage":["https://openalex.org/I173899330"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Congran Wang","raw_affiliation_strings":["College of Computer and Information Engineering, Henan University, Kaifeng, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Engineering, Henan University, Kaifeng, China","institution_ids":["https://openalex.org/I173899330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034961680","display_name":"Gaojuan Fan","orcid":"https://orcid.org/0000-0003-3418-9772"},"institutions":[{"id":"https://openalex.org/I173899330","display_name":"Henan University","ror":"https://ror.org/003xyzq10","country_code":"CN","type":"education","lineage":["https://openalex.org/I173899330"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gaojuan Fan","raw_affiliation_strings":["College of Computer and Information Engineering, Henan University, Kaifeng, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Engineering, Henan University, Kaifeng, China","institution_ids":["https://openalex.org/I173899330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5034961680"],"corresponding_institution_ids":["https://openalex.org/I173899330"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06580504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","issue":"1","first_page":"257","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9674000144004822,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.9339078664779663},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7648732662200928},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6729295253753662},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6077932119369507},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6068907380104065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5585294365882874},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5501561164855957},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5365005135536194},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5003983974456787},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.49852895736694336},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49565303325653076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4888543486595154},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4581242799758911},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.429423987865448},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.37630772590637207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3717794418334961}],"concepts":[{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.9339078664779663},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7648732662200928},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6729295253753662},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6077932119369507},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6068907380104065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5585294365882874},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5501561164855957},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5365005135536194},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5003983974456787},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.49852895736694336},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49565303325653076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4888543486595154},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4581242799758911},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.429423987865448},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.37630772590637207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3717794418334961},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-223404","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-223404","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W1194849549","https://openalex.org/W2004864856","https://openalex.org/W2008616734","https://openalex.org/W2009168408","https://openalex.org/W2063277077","https://openalex.org/W2109101401","https://openalex.org/W2111581650","https://openalex.org/W2162423772","https://openalex.org/W2168210873","https://openalex.org/W2567474168","https://openalex.org/W2605469297","https://openalex.org/W2606926586","https://openalex.org/W2805193426","https://openalex.org/W2890000897","https://openalex.org/W2938888742","https://openalex.org/W2944798258","https://openalex.org/W2952888867","https://openalex.org/W2996796639","https://openalex.org/W3006333943","https://openalex.org/W3094194273","https://openalex.org/W3096415170","https://openalex.org/W3103852614","https://openalex.org/W3146344560","https://openalex.org/W4249028460","https://openalex.org/W4306922461","https://openalex.org/W6774393592","https://openalex.org/W6784577741"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W1996453501","https://openalex.org/W2005660029","https://openalex.org/W4237368524","https://openalex.org/W3204855000","https://openalex.org/W2123829500","https://openalex.org/W4237239244","https://openalex.org/W2949474276","https://openalex.org/W4229972021","https://openalex.org/W90886653"],"abstract_inverted_index":{"Multi-compartment":[0],"vehicle":[1,12,25],"routing":[2,13],"problem":[3,14],"(MCVRP)":[4],"is":[5,37],"an":[6],"extension":[7],"of":[8,69,141],"the":[9,40,46,67,73,89,116,121,126,131,139,152,168],"classical":[10],"capacitated":[11],"where":[15],"products":[16],"with":[17,26,32],"different":[18],"characteristics":[19],"are":[20],"transported":[21],"together":[22],"in":[23,115],"one":[24],"multiple":[27],"compartments.":[28],"This":[29],"paper":[30],"deals":[31],"this":[33],"problem,":[34],"whose":[35],"objective":[36],"to":[38,63,101,112,137],"minimize":[39],"total":[41],"travel":[42],"distance":[43],"while":[44],"satisfying":[45],"capacity":[47],"and":[48,106,151],"maximum":[49],"route":[50],"length":[51],"constraints.":[52],"We":[53],"proposed":[54],"a":[55,93,108],"hybrid":[56],"iterated":[57,70],"local":[58,71,90],"search":[59,91],"metaheuristic":[60],"(HILS)":[61],"algorithm":[62,127,159],"solve":[64],"it.":[65],"In":[66,119],"framework":[68],"search,":[72],"current":[74],"solution":[75,87,104,111],"was":[76,99],"improved":[77],"iteratively":[78],"by":[79,125,130],"five":[80],"neighborhood":[81,86,95,110],"operators.":[82],"For":[83],"every":[84],"obtained":[85],"after":[88],"procedure,":[92],"large":[94],"search-based":[96],"perturbation":[97],"method":[98],"executed":[100],"explore":[102],"larger":[103],"space":[105],"get":[107],"better":[109],"take":[113],"part":[114],"next":[117],"iteration.":[118],"addition,":[120],"worse":[122],"solutions":[123],"found":[124],"were":[128,145],"accepted":[129],"nondeterministic":[132],"simulated":[133],"annealing-based":[134],"acceptance":[135],"rule":[136],"keep":[138],"diversification":[140],"solutions.":[142],"Computation":[143],"experiments":[144],"conducted":[146],"on":[147],"28":[148],"benchmark":[149],"instances":[150],"experimental":[153],"results":[154],"demonstrate":[155],"that":[156],"our":[157],"presented":[158],"finds":[160],"17":[161],"new":[162],"best":[163],"solutions,":[164],"which":[165],"significantly":[166],"outperforms":[167],"existing":[169],"state-of-the-art":[170],"MCVRP":[171],"methods.":[172]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}