{"id":"https://openalex.org/W2313316345","doi":"https://doi.org/10.1109/codit.2014.6996891","title":"A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows","display_name":"A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2313316345","doi":"https://doi.org/10.1109/codit.2014.6996891","mag":"2313316345"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2014.6996891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne, UR EPROAD - EA 4669, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne, UR EPROAD - EA 4669, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030535447","display_name":"Lei Wu","orcid":"https://orcid.org/0000-0001-5641-3259"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lei Wu","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne, UR EPROAD - EA 4669, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne, UR EPROAD - EA 4669, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2485,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8476721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"194"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9925000071525574,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.891919732093811},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7991722822189331},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7008328437805176},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6918485760688782},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6548802852630615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.641687273979187},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6416578888893127},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5250177979469299},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.46085113286972046},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44846025109291077},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44366446137428284},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.42699605226516724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23920926451683044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2179090976715088}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.891919732093811},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7991722822189331},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7008328437805176},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6918485760688782},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6548802852630615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.641687273979187},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6416578888893127},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5250177979469299},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.46085113286972046},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44846025109291077},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44366446137428284},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.42699605226516724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23920926451683044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2179090976715088},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"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/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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2014.6996891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5400000214576721,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W159794904","https://openalex.org/W1532651649","https://openalex.org/W1554727768","https://openalex.org/W1588856286","https://openalex.org/W1597183383","https://openalex.org/W1601649239","https://openalex.org/W1915250243","https://openalex.org/W1968686257","https://openalex.org/W1973565128","https://openalex.org/W2018691209","https://openalex.org/W2018743970","https://openalex.org/W2029308727","https://openalex.org/W2031722814","https://openalex.org/W2035874923","https://openalex.org/W2079333601","https://openalex.org/W2083720185","https://openalex.org/W2096305430","https://openalex.org/W2158000627","https://openalex.org/W2162423772","https://openalex.org/W2162508334","https://openalex.org/W2297395784","https://openalex.org/W2358128336","https://openalex.org/W2622576046","https://openalex.org/W3098027436","https://openalex.org/W3127850350","https://openalex.org/W4238780727","https://openalex.org/W6606618622","https://openalex.org/W6697634807","https://openalex.org/W6706926445"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2017411971","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2981400081","https://openalex.org/W2172069777"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,52],"propose":[4,53],"to":[5,38,48,120,158,185],"solve":[6],"the":[7,28,33,36,58,77,87,90,122,125,142,159,164,168,175],"Vehicle":[8],"Routing":[9],"Problem":[10,92],"with":[11,100],"Time":[12,101],"Windows":[13,102],"(VRPTW)":[14],"using":[15,111],"a":[16,22,62,67,94,128,135,148],"hybrid":[17,177],"metaheuristic.":[18],"The":[19],"VRPTW":[20,83],"is":[21,45,84,132,139,145,183],"bi-objective":[23],"optimization":[24,115],"problem":[25],"where":[26,141],"both":[27,50],"number":[29],"of":[30,35,64,82,89,96,124,150],"vehicles":[31],"and":[32,93,106,153,181],"distance":[34,59],"travel":[37],"use":[39],"should":[40],"be":[41],"minimized.":[42],"Because":[43],"it":[44,182],"often":[46],"difficult":[47],"optimize":[49],"objectives,":[51],"an":[54,80,112],"approach":[55],"that":[56,174],"optimizes":[57],"traveled":[60],"by":[61,73,110,163],"fleet":[63],"vehicles.":[65],"Such":[66],"strategy":[68],"has":[69],"been":[70],"already":[71],"used":[72],"several":[74],"authors":[75],"in":[76,118,167],"domain.":[78],"Herein,":[79],"instance":[81],"considered":[85],"as":[86],"composition":[88],"Assignment":[91],"series":[95],"Traveling":[97],"Salesman":[98],"Problems":[99],"(TSPTW).":[103],"Both":[104],"AP":[105],"TSPTW":[107],"are":[108,156],"solved":[109],"ant":[113],"colony":[114],"system.":[116],"Furthermore,":[117],"order":[119],"enhance":[121],"quality":[123],"current":[126],"solution,":[127],"large":[129],"neighborhood":[130],"search":[131],"introduced.":[133],"Finally,":[134],"preliminary":[136,171],"experimental":[137],"part":[138],"presented":[140],"proposed":[143,176],"method":[144,178],"evaluated":[146],"on":[147],"set":[149],"benchmark":[151],"instances":[152],"its":[154],"results":[155,161,172],"compared":[157],"best":[160],"obtained":[162],"methods":[165],"available":[166],"literature.":[169],"Our":[170],"show":[173],"remains":[179],"competitive":[180],"able":[184],"reach":[186],"new":[187],"minimum":[188],"distances":[189],"for":[190],"some":[191],"tested":[192],"instances.":[193]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}