{"id":"https://openalex.org/W2804352272","doi":"https://doi.org/10.1109/icnsc.2018.8361368","title":"A hybrid algorithm for the vehicle routing problem with compatibility constraints","display_name":"A hybrid algorithm for the vehicle routing problem with compatibility constraints","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2804352272","doi":"https://doi.org/10.1109/icnsc.2018.8361368","mag":"2804352272"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2018.8361368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2018.8361368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 15th 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/A5100447861","display_name":"Can Liu","orcid":"https://orcid.org/0000-0001-5451-4144"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Can Liu","raw_affiliation_strings":["School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100751707","display_name":"Zizhen Zhang","orcid":"https://orcid.org/0000-0003-0320-9355"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zizhen Zhang","raw_affiliation_strings":["School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017047924","display_name":"Xinxin Su","orcid":"https://orcid.org/0000-0002-0255-1805"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinxin Su","raw_affiliation_strings":["School of Management, Huazhong University of Science and Technology, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Management, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101932134","display_name":"Hu Qin","orcid":"https://orcid.org/0000-0003-4794-2807"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hu Qin","raw_affiliation_strings":["School of Management, Huazhong University of Science and Technology, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Management, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100447861"],"corresponding_institution_ids":["https://openalex.org/I157773358"],"apc_list":null,"apc_paid":null,"fwci":0.2463,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61462465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":null,"first_page":"1","last_page":"6"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9929999709129333,"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.9889000058174133,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.8641245365142822},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8124046921730042},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6661494374275208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6277344226837158},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6204251050949097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6097118258476257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5464602112770081},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5163251757621765},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5108246803283691},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.27121099829673767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20769500732421875}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8641245365142822},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8124046921730042},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6661494374275208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6277344226837158},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6204251050949097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6097118258476257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5464602112770081},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5163251757621765},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5108246803283691},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.27121099829673767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20769500732421875},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2018.8361368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2018.8361368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC)","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":14,"referenced_works":["https://openalex.org/W124428182","https://openalex.org/W2000840218","https://openalex.org/W2002284890","https://openalex.org/W2020367806","https://openalex.org/W2029681015","https://openalex.org/W2107631366","https://openalex.org/W2140043891","https://openalex.org/W2148948822","https://openalex.org/W2462800345","https://openalex.org/W2555729856","https://openalex.org/W2567449761","https://openalex.org/W2618144004","https://openalex.org/W2954311859","https://openalex.org/W6730138047"],"related_works":["https://openalex.org/W2052469048","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W1611875833","https://openalex.org/W2794855054","https://openalex.org/W3159581029","https://openalex.org/W2005169299","https://openalex.org/W2324905915","https://openalex.org/W2919842722","https://openalex.org/W2144570772"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,39,48,79],"vehicle":[4],"routing":[5],"problem":[6],"with":[7],"compatibility":[8],"constraints":[9],"(VRPCC).":[10],"It":[11],"is":[12,83,107,113],"originated":[13],"from":[14],"an":[15,58],"application":[16],"of":[17,24,42,103,122],"the":[18,34,43,65,88,104,110,118,123,127],"cold-chain":[19,25],"logistics":[20],"where":[21],"different":[22],"types":[23],"products":[26],"may":[27,29],"or":[28],"not":[30],"be":[31],"delivered":[32],"at":[33],"same":[35],"time.":[36],"We":[37,91],"provide":[38],"detailed":[40],"description":[41],"VRPCC":[44,99],"and":[45,71,109,120],"then":[46],"propose":[47],"hybrid":[49,105],"metaheuristic":[50],"algorithm":[51,56,106,124],"for":[52],"solving":[53,126],"it.":[54],"The":[55,101,115],"includes":[57],"ant":[59],"colony":[60],"optimization":[61],"process,":[62],"in":[63,125],"which":[64],"new":[66],"state":[67],"transition":[68],"probability":[69],"formula":[70],"pheromone":[72],"updating":[73],"rule":[74],"are":[75],"applied.":[76],"In":[77],"addition,":[78],"tabu":[80],"search":[81],"process":[82],"involved":[84],"to":[85,97],"further":[86],"improve":[87],"solution":[89],"quality.":[90],"modify":[92],"several":[93],"VRP":[94],"benchmark":[95],"data":[96],"form":[98],"instances.":[100],"performance":[102],"evaluated":[108],"parameter":[111],"analysis":[112],"conducted.":[114],"results":[116],"demonstrate":[117],"effectiveness":[119],"efficiency":[121],"VRPCC.":[128]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}