{"id":"https://openalex.org/W4402352453","doi":"https://doi.org/10.1109/tevc.2024.3456585","title":"A Memetic Algorithm for Vehicle Routing With Simultaneous Pickup and Delivery and Time Windows","display_name":"A Memetic Algorithm for Vehicle Routing With Simultaneous Pickup and Delivery and Time Windows","publication_year":2024,"publication_date":"2024-09-09","ids":{"openalex":"https://openalex.org/W4402352453","doi":"https://doi.org/10.1109/tevc.2024.3456585"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2024.3456585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2024.3456585","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","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/A5037203593","display_name":"Zhenyu Lei","orcid":"https://orcid.org/0000-0003-2086-479X"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zhenyu Lei","raw_affiliation_strings":["Department of Computer Science, LERIA, Université d'Angers, Angers, France","Department of Computer Science, LERIA, Université d’Angers, 2 Boulevard Lavoisier, Angers Cedex 01, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, LERIA, Université d'Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]},{"raw_affiliation_string":"Department of Computer Science, LERIA, Université d’Angers, 2 Boulevard Lavoisier, Angers Cedex 01, France","institution_ids":["https://openalex.org/I49451733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016332970","display_name":"Jin\u2010Kao Hao","orcid":"https://orcid.org/0000-0001-8813-4377"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jin-Kao Hao","raw_affiliation_strings":["Department of Computer Science, LERIA, Université d'Angers, Angers, France","Department of Computer Science, LERIA, Université d’Angers, 2 Boulevard Lavoisier, Angers Cedex 01, France"],"raw_orcid":"https://orcid.org/0000-0001-8813-4377","affiliations":[{"raw_affiliation_string":"Department of Computer Science, LERIA, Université d'Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]},{"raw_affiliation_string":"Department of Computer Science, LERIA, Université d’Angers, 2 Boulevard Lavoisier, Angers Cedex 01, France","institution_ids":["https://openalex.org/I49451733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I49451733"],"apc_list":null,"apc_paid":null,"fwci":0.6486,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70625879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"29","issue":"5","first_page":"1924","last_page":"1936"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9886000156402588,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9886000156402588,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9722999930381775,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9617000222206116,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8746243715286255},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8574545383453369},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.8523250818252563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6209036111831665},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5488971471786499},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4690077006816864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.458753377199173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45769932866096497},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.41391271352767944},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3990436792373657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2584206461906433},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23067206144332886},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13803741335868835},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13074398040771484}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8746243715286255},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8574545383453369},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.8523250818252563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6209036111831665},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5488971471786499},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4690077006816864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.458753377199173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45769932866096497},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.41391271352767944},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3990436792373657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2584206461906433},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23067206144332886},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13803741335868835},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13074398040771484},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tevc.2024.3456585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2024.3456585","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05634704v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05634704","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":"IEEE Transactions on Evolutionary Computation, 2025, 29 (5), pp.1924-1936. ⟨10.1109/TEVC.2024.3456585⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5549952104","display_name":null,"funder_award_id":"202206330014","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"},{"id":"https://openalex.org/G6148423878","display_name":null,"funder_award_id":"20220633001","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W77000695","https://openalex.org/W187303438","https://openalex.org/W1516061453","https://openalex.org/W1857789879","https://openalex.org/W1902927221","https://openalex.org/W1913397490","https://openalex.org/W1979488556","https://openalex.org/W1982966841","https://openalex.org/W1989604479","https://openalex.org/W2000655536","https://openalex.org/W2008434012","https://openalex.org/W2031935785","https://openalex.org/W2035874923","https://openalex.org/W2063939203","https://openalex.org/W2073798563","https://openalex.org/W2081708500","https://openalex.org/W2092220612","https://openalex.org/W2096305430","https://openalex.org/W2118944864","https://openalex.org/W2120470208","https://openalex.org/W2135331367","https://openalex.org/W2262276395","https://openalex.org/W2883592941","https://openalex.org/W2939269302","https://openalex.org/W3028512226","https://openalex.org/W3082126206","https://openalex.org/W3132404260","https://openalex.org/W3170601965","https://openalex.org/W4200515657","https://openalex.org/W4304187825","https://openalex.org/W4360999374","https://openalex.org/W4388088189","https://openalex.org/W4391547539"],"related_works":["https://openalex.org/W2360254753","https://openalex.org/W1499685530","https://openalex.org/W2774602532","https://openalex.org/W2277326438","https://openalex.org/W2741596907","https://openalex.org/W4248894450","https://openalex.org/W2385780082","https://openalex.org/W2163647484","https://openalex.org/W1977672343","https://openalex.org/W4293253022"],"abstract_inverted_index":{"The":[0],"vehicle":[1],"routing":[2],"problem":[3],"with":[4],"simultaneous":[5],"pickup":[6],"and":[7,9,37,42,87],"delivery":[8],"time":[10],"windows":[11],"(VRPSPDTW)":[12],"has":[13],"a":[14,34,43,79],"number":[15],"of":[16,57,64,89],"real-world":[17,73],"applications,":[18],"especially":[19],"in":[20],"reverse":[21],"logistics.":[22],"In":[23],"this":[24,50],"work,":[25],"we":[26],"propose":[27],"an":[28],"effective":[29],"memetic":[30],"algorithm":[31,60],"that":[32],"integrates":[33],"lightweight":[35],"feasible":[36],"infeasible":[38],"route":[39],"descent":[40],"search":[41],"learning-based":[44],"adaptive":[45],"route-inheritance":[46],"crossover":[47],"to":[48,82],"solve":[49],"complex":[51],"problem.":[52],"We":[53,77],"evaluate":[54],"the":[55,58,62,85,90],"effectiveness":[56],"proposed":[59,91],"on":[61],"set":[63],"65":[65],"popular":[66],"benchmark":[67,75],"instances":[68],"as":[69,71],"well":[70],"20":[72],"large-scale":[74],"instances.":[76],"provide":[78],"comprehensive":[80],"analysis":[81],"better":[83],"understand":[84],"design":[86],"performance":[88],"algorithm.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}