{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T17:35:09Z","timestamp":1786988109158,"version":"3.56.0"},"reference-count":69,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ejor.2022.11.029","type":"journal-article","created":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T09:31:36Z","timestamp":1669455096000},"page":"1142-1159","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":45,"title":["The vehicle routing problem with time windows and flexible delivery locations"],"prefix":"10.1016","volume":"308","author":[{"given":"Christian M.M.","family":"Frey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-3437-2956","authenticated-orcid":false,"given":"Alexander","family":"Jungwirth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Frey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-8001-3009","authenticated-orcid":false,"given":"Rainer","family":"Kolisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0001","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","article-title":"Insertion techniques for static and dynamic resource-constrained project scheduling","volume":"149","author":"Artigues","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0002","unstructured":"Audi AG (2015). Audi, DHL and amazon deliver convenience. https:\/\/2.zoppoz.workers.dev:443\/https\/www.audi-mediacenter.com\/en\/press-releases\/audi-dhl-and-amazon-deliver-convenience-347."},{"key":"10.1016\/j.ejor.2022.11.029_bib0003","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","article-title":"An adaptive large neighborhood search for a vehicle routing problem with multiple routes","volume":"41","author":"Azi","year":"2014","journal-title":"Computers and Operations Research"},{"issue":"7","key":"10.1016\/j.ejor.2022.11.029_bib0004","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1057\/jors.2009.51","article-title":"Some applications of the generalized vehicle routing problem","volume":"61","author":"Baldacci","year":"2010","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.11.029_bib0005","first-page":"161","article-title":"Chapter 6: Pickup-and-delivery problems for goods transportation","author":"Battarra","year":"2014"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0006","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02568604","article-title":"The vehicle routing-allocation problem: A unifying framework","volume":"4","author":"Beasley","year":"1996","journal-title":"TOP"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0007","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/trsc.1100.0352","article-title":"Formulations and branch-and-cut algorithms for the generalized vehicle routing problem","volume":"45","author":"Bekta\u015f","year":"2011","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0008","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1111\/j.1467-9787.1961.tb01276.x","article-title":"The relationship between transportation costs and location rent in transportation problems","volume":"3","author":"von Boventer","year":"1961","journal-title":"Journal of Regional Science"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0009","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: Notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0010","doi-asserted-by":"crossref","first-page":"104759","DOI":"10.1016\/j.cor.2019.07.017","article-title":"The green vehicle routing problem with capacitated alternative fuel stations","volume":"112","author":"Bruglieri","year":"2019","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2022.11.029_bib0011","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","article-title":"A guide to vehicle routing heuristics","volume":"53","author":"Cordeau","year":"2002","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"10.1016\/j.ejor.2022.11.029_bib0012","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.11.029_bib0013","series-title":"Proceedings of the 19th design automation conference, DAC \u201982","first-page":"432","article-title":"Automated rip-up and reroute techniques","author":"Dees","year":"1982"},{"key":"10.1016\/j.ejor.2022.11.029_bib0014","first-page":"119","article-title":"Chapter 5: The vehicle routing problem with time windows","author":"Desaulniers","year":"2014"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0015","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0167-9236(98)00090-6","article-title":"Towards a model and algorithm management system for vehicle routing and scheduling problems","volume":"25","author":"Desrochers","year":"1999","journal-title":"Decision Support Systems"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0016","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(90)90007-X","article-title":"A classification scheme for vehicle routing and scheduling problems","volume":"46","author":"Desrochers","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0017","first-page":"193","article-title":"Chapter 7: Pickup-and-delivery problems for people transportation","author":"Doerner","year":"2014"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0018","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing\u2013a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2022.11.029_bib0019","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","article-title":"A large neighborhood search approach to the vehicle routing problem with delivery options","volume":"144","author":"Dumez","year":"2021","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2022.11.029_bib0020","doi-asserted-by":"crossref","first-page":"100040","DOI":"10.1016\/j.ejtl.2021.100040","article-title":"Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows (revision 2)","volume":"10","author":"Dumez","year":"2021","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"4","key":"10.1016\/j.ejor.2022.11.029_bib0021","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","article-title":"The vehicle routing problem: A taxonomic review","volume":"57","author":"Eksioglu","year":"2009","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0022","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/trsc.2021.1111","article-title":"The electric vehicle routing problem with capacitated charging stations","volume":"56","author":"Froger","year":"2022","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2022.11.029_bib0023","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1080\/24725579.2018.1530314","article-title":"Hospital-wide therapist scheduling and routing: Exact and heuristic methods","volume":"8","author":"Gartner","year":"2018","journal-title":"IISE Transactions on Healthcare Systems Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_sbref0023","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","article-title":"An efficient transformation of the generalized vehicle routing problem","volume":"122","author":"Ghiani","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0025","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","article-title":"The case for strategic oscillation","volume":"183","author":"Glover","year":"2011","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0026","article-title":"The vehicle routing problem: Latest advances and new challenges","year":"2008"},{"key":"10.1016\/j.ejor.2022.11.029_bib0027","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","article-title":"A survey of dial-a-ride problems: Literature review and recent developments","volume":"111","author":"Ho","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2022.11.029_bib0028","first-page":"1","article-title":"Chapter 1: The family of vehicle routing problems","author":"Irnich","year":"2014"},{"issue":"8","key":"10.1016\/j.ejor.2022.11.029_bib0029","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond k-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0030","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1287\/ijoc.2021.1119","article-title":"Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity","volume":"34","author":"Jungwirth","year":"2022","journal-title":"INFORMS Journal on Computing"},{"issue":"4598","key":"10.1016\/j.ejor.2022.11.029_bib0031","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_sbref0031","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","article-title":"Event-based MILP models for resource-constrained project scheduling problems","volume":"38","author":"Kon\u00e9","year":"2011","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0033","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/net.21522","article-title":"A template-based adaptive large neighborhood search for the consistent vehicle routing problem","volume":"63","author":"Kovacs","year":"2014","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0034","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0035","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","article-title":"Rich vehicle routing problems: From a taxonomy to a definition","volume":"241","author":"Lahyani","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0036","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/s10601-016-9241-2","article-title":"A branch-and-price-and-check model for the vehicle routing problem with location congestion","volume":"21","author":"Lam","year":"2016","journal-title":"Constraints"},{"issue":"4","key":"10.1016\/j.ejor.2022.11.029_bib0037","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty years of vehicle routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0038","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","article-title":"Routing problems: A bibliography","volume":"61","author":"Laporte","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0039","first-page":"87","article-title":"Chapter 4: Heuristics for the vehicle routing problem","author":"Laporte","year":"2014"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0040","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","article-title":"Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests","volume":"252","author":"Li","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0041","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","article-title":"A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: Formulation and adaptive large neighborhood search based matheuristic","volume":"70","author":"Mancini","year":"2016","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2022.11.029_bib0042","series-title":"Automatic design for matheuristics","first-page":"35","author":"Maniezzo","year":"2021"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0043","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2307\/3007214","article-title":"On the location of supply points to minimize transport costs","volume":"15","author":"Maranzana","year":"1964","journal-title":"OR"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0044","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/trsc.1120.0432","article-title":"An adaptive large neighborhood search for the pickup and delivery problem with transfers","volume":"47","author":"Masson","year":"2013","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0045","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1057\/jors.2011.25","article-title":"An incremental tabu search heuristic for the generalized vehicle routing problem with time windows","volume":"63","author":"Moccia","year":"2012","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.11.029_bib0046","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.trb.2017.02.003","article-title":"A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations","volume":"100","author":"Ozbaygin","year":"2017","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2022.11.029_bib0047","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.cor.2017.01.020","article-title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","volume":"83","author":"Parragh","year":"2017","journal-title":"Computers and Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2022.11.029_bib0048","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0049","first-page":"99","article-title":"Large neighborhood search","author":"Pisinger","year":"2019"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0050","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithm for the vehicle routing and scheduling problem with time windows","volume":"66","author":"Potvin","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0051","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","article-title":"A survey of recent research on location-routing problems","volume":"238","author":"Prodhon","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0052","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.trc.2017.04.003","article-title":"Vehicle routing with roaming delivery locations","volume":"80","author":"Reyes","year":"2017","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"4","key":"10.1016\/j.ejor.2022.11.029_bib0053","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_sbref0053","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","article-title":"A unified heuristic for a large class of vehicle routing problems with backhauls","volume":"171","author":"Ropke","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0055","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/trsc.2016.0675","article-title":"50th anniversary invited article - city logistics: Challenges and opportunities","volume":"50","author":"Savelsbergh","year":"2016","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0056","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/trsc.2017.0746","article-title":"An adaptive large neighborhood search for the location-routing problem with intra-route facilities","volume":"52","author":"Schiffer","year":"2018","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0057","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","article-title":"Record breaking optimization results using the ruin and recreate principle","volume":"159","author":"Schrimpf","year":"2000","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/j.ejor.2022.11.029_bib0058","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"key":"10.1016\/j.ejor.2022.11.029_bib0059","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2022.11.029_bib0060","first-page":"541","article-title":"Automated design of metaheuristic algorithms","author":"St\u00fctzle","year":"2019"},{"key":"10.1016\/j.ejor.2022.11.029_bib0061","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00291-021-00633-0","article-title":"The last-mile vehicle routing problem with delivery options","volume":"43","author":"Tilk","year":"2021","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2022.11.029_bib0062","series-title":"The vehicle routing problem","author":"Toth","year":"2002"},{"key":"10.1016\/j.ejor.2022.11.029_bib0063","series-title":"Vehicle routing","author":"Toth","year":"2014"},{"issue":"1","key":"10.1016\/j.ejor.2022.11.029_bib0064","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0065","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10732-014-9273-y","article-title":"Time-window relaxations in vehicle routing heuristics","volume":"21","author":"Vidal","year":"2015","journal-title":"Journal of Heuristics"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0066","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","article-title":"A concise guide to existing and emerging vehicle routing problem variants","volume":"286","author":"Vidal","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.11.029_bib0067","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","article-title":"Guided local search and its application to the traveling salesman problem","volume":"113","author":"Voudouris","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0068","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0305-0483(73)90108-4","article-title":"Depot location with van salesmen\u2014A practical approach","volume":"1","author":"Watson-Gandy","year":"1973","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.ejor.2022.11.029_bib0069","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1057\/jors.1968.74","article-title":"Cost functions in the location of depots for multiple-delivery journeys","volume":"19","author":"Webb","year":"1968","journal-title":"Journal of the Operational Research Society"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0377221722008888?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0377221722008888?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T13:18:08Z","timestamp":1759843088000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221722008888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["S0377221722008888"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejor.2022.11.029","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The vehicle routing problem with time windows and flexible delivery locations","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejor.2022.11.029","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}