{"id":"https://openalex.org/W2132450795","doi":"https://doi.org/10.1051/ro:2008021","title":"A memetic algorithm for the vehicle routing problem with time windows","display_name":"A memetic algorithm for the vehicle routing problem with time windows","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2132450795","doi":"https://doi.org/10.1051/ro:2008021","mag":"2132450795"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2008021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2008021","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2008021.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015481283","display_name":"Nacima Labadi","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nacima Labadi","raw_affiliation_strings":["Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","institution_ids":["https://openalex.org/I140494188","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017877687","display_name":"Christian Prins","orcid":"https://orcid.org/0000-0002-0184-0357"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christian Prins","raw_affiliation_strings":["Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","institution_ids":["https://openalex.org/I140494188","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003978035","display_name":"Mohamed Reghioui","orcid":"https://orcid.org/0000-0002-5248-4612"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Reghioui","raw_affiliation_strings":["Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. Charles Delaunay, Univ. Technologie Troyes, FRE CNRS 2848, BP 2060, 10010 Troyes Cedex, France; nacima.labadi@utt.fr, christian.prins@utt.fr, mohamed.reghioui_hamzaoui@utt.fr","institution_ids":["https://openalex.org/I140494188","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.04,"has_fulltext":true,"cited_by_count":82,"citation_normalized_percentile":{"value":0.97856372,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"42","issue":"3","first_page":"415","last_page":"431"},"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.9926999807357788,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.9211750030517578},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.8868812322616577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6206328272819519},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.616382360458374},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5805543065071106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5306552648544312},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49252185225486755},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4903757572174072},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48466402292251587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4464857578277588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3737443685531616}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.9211750030517578},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8868812322616577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6206328272819519},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.616382360458374},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5805543065071106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5306552648544312},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49252185225486755},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4903757572174072},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48466402292251587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4464857578277588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3737443685531616},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:2008021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2008021","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2008__42_3_415_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2008021/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2008021.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:HAL:hal-02477527v1","is_oa":false,"landing_page_url":"https://utt.hal.science/hal-02477527","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RAIRO - Operations Research, 2008, 42 (3), pp.415-431. ⟨10.1051/ro:2008021⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2008__42_3_415_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2008021/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2008021.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2132450795.pdf","grobid_xml":"https://content.openalex.org/works/W2132450795.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W9632173","https://openalex.org/W12382299","https://openalex.org/W151510607","https://openalex.org/W159794904","https://openalex.org/W187359699","https://openalex.org/W364832461","https://openalex.org/W1487758851","https://openalex.org/W1497256448","https://openalex.org/W1509491850","https://openalex.org/W1515023053","https://openalex.org/W1554727768","https://openalex.org/W1561239738","https://openalex.org/W1568952562","https://openalex.org/W1597183383","https://openalex.org/W1740984858","https://openalex.org/W1984594269","https://openalex.org/W1987456721","https://openalex.org/W2007401074","https://openalex.org/W2010418932","https://openalex.org/W2017209461","https://openalex.org/W2018743970","https://openalex.org/W2045312576","https://openalex.org/W2066086285","https://openalex.org/W2069850304","https://openalex.org/W2079333601","https://openalex.org/W2084977713","https://openalex.org/W2096305430","https://openalex.org/W2096590200","https://openalex.org/W2106972943","https://openalex.org/W2108753073","https://openalex.org/W2111174053","https://openalex.org/W2111581650","https://openalex.org/W2116675171","https://openalex.org/W2143731413","https://openalex.org/W2152150600","https://openalex.org/W2158000627","https://openalex.org/W2162508334","https://openalex.org/W2291407899","https://openalex.org/W2403905232","https://openalex.org/W2904250082"],"related_works":["https://openalex.org/W2774602532","https://openalex.org/W2385780082","https://openalex.org/W2163647484","https://openalex.org/W1977672343","https://openalex.org/W2996796639","https://openalex.org/W47248985","https://openalex.org/W2132450795","https://openalex.org/W4293253022","https://openalex.org/W2000270779","https://openalex.org/W2171107778"],"abstract_inverted_index":{"This":[0,12],"article":[1],"deals":[2],"with":[3,8,42],"the":[4,51,56,67,82,88,93,99,104],"vehicle":[5],"routing":[6],"problem":[7,13],"time":[9,27],"windows":[10],"(VRPTW).":[11],"consists":[14],"in":[15],"determining":[16],"a":[17,34,38,43],"least-cost":[18],"set":[19],"of":[20,58,81,87],"trips":[21],"to":[22,47,65,79],"serve":[23],"customers":[24],"during":[25],"specific":[26],"windows.":[28],"The":[29,71,85],"proposed":[30],"solution":[31],"method":[32,61],"is":[33,62,90],"memetic":[35],"algorithm":[36,40,101],"(MA),":[37],"genetic":[39],"hybridised":[41],"local":[44],"search.":[45],"Contrary":[46],"most":[48],"papers":[49],"on":[50,73],"VRPTW,":[52],"which":[53],"minimize":[54,66],"first":[55],"number":[57],"vehicles,":[59],"our":[60],"also":[63],"able":[64],"total":[68,105],"distance":[69],"travelled.":[70],"results":[72],"56":[74],"classical":[75,94],"instances":[76],"are":[77],"compared":[78],"those":[80],"best":[83,100],"metaheuristics.":[84],"efficiency":[86],"MA":[89],"similar":[91],"for":[92,103],"criterion,":[95],"but":[96],"it":[97],"becomes":[98],"available":[102],"distance,":[106],"being":[107],"much":[108],"faster":[109],"and":[110],"improving":[111],"20":[112],"best-known":[113],"solutions.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}