{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T17:09:23Z","timestamp":1717002563150},"reference-count":71,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1016\/j.ejor.2022.07.039","type":"journal-article","created":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T12:08:20Z","timestamp":1659182900000},"page":"707-741","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing earliness-tardiness costs in supplier networks\u2014A just-in-time truck routing problem"],"prefix":"10.1016","volume":"306","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7037-9931","authenticated-orcid":false,"given":"Julian","family":"Baals","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6932-0166","authenticated-orcid":false,"given":"Simon","family":"Emde","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9118-1561","authenticated-orcid":false,"given":"Marcel","family":"Turkensteen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2022.07.039_bib0001","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.cor.2015.03.014","article-title":"Multi-period vehicle routing problem with due dates","volume":"61","author":"Archetti","year":"2015","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0002","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1057\/jors.1993.53","article-title":"Simple heuristics for the vehicle routeing problem with soft time windows","volume":"44","author":"Balakrishnan","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.07.039_sbref0003","series-title":"Vehicle routing","first-page":"161","article-title":"Pickup-and-delivery problems for goods transportation","author":"Battarra","year":"2014"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"TOP"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0005","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","article-title":"Dynamic pickup and delivery problems","volume":"202","author":"Berbeglia","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0006","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s12532-014-0064-0","article-title":"A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows","volume":"6","author":"Bettinelli","year":"2014","journal-title":"Mathematical Programming Computation"},{"key":"10.1016\/j.ejor.2022.07.039_bib0007","series-title":"Eighth international conference on city logistics","first-page":"171","article-title":"Application of the just-in-time concept in urban freight transport","volume":"vol. 125","author":"Bhusiri","year":"2014"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0008","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ejor.2014.09.065","article-title":"Part logistics in the automotive industry: Decision problems, literature review and research agenda","volume":"242","author":"Boysen","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.07.039_bib0009","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0010","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle routing problem with time windows, part I: Route construction and local search algorithms","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0011","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","article-title":"Vehicle routing problem with time windows, part II: Metaheuristics","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transportation Science"},{"issue":"12","key":"10.1016\/j.ejor.2022.07.039_bib0012","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","article-title":"A metaheuristic for the vehicle-routeing problem with soft time windows","volume":"55","author":"Chiang","year":"2004","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0013","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0014","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.21917","article-title":"A two-level local search heuristic for pickup and delivery problems in express freight trucking","volume":"74","author":"De Giovanni","year":"2019","journal-title":"Networks"},{"issue":"5","key":"10.1016\/j.ejor.2022.07.039_bib0015","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S1874-8651(10)60049-X","article-title":"Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery","volume":"29","author":"Deng","year":"2009","journal-title":"Systems Engineering - Theory and Practice"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0016","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0017","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00013346","article-title":"Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up","volume":"23","author":"Dethloff","year":"2001","journal-title":"OR-Spektrum"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0018","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/trsc.2018.0824","article-title":"Just-in-time vehicle routing for in-house part feeding to assembly lines","volume":"52","author":"Emde","year":"2018","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0019","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s11590-018-1342-y","article-title":"Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows","volume":"14","author":"Fachini","year":"2020","journal-title":"Optimization Letters"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0020","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","article-title":"Ship scheduling with soft time windows: An optimisation based approach","volume":"131","author":"Fagerholt","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2022.07.039_bib0021","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","article-title":"A unified tabu search algorithm for vehicle routing problems with soft time windows","volume":"59","author":"Fu","year":"2008","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.07.039_bib0022","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.jclepro.2020.120824","article-title":"A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows","volume":"259","author":"Ganji","year":"2020","journal-title":"Journal of Cleaner Production"},{"key":"10.1016\/j.ejor.2022.07.039_bib0023","series-title":"Proceedings of EUROGEN99","first-page":"57","article-title":"A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows","volume":"vol.\u00a02","author":"Gehring","year":"1999"},{"issue":"6","key":"10.1016\/j.ejor.2022.07.039_bib0024","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2022.07.039_bib0025","series-title":"Handbook of metaheuristics","author":"Gendreau","year":"2019"},{"issue":"5","key":"10.1016\/j.ejor.2022.07.039_bib0026","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2022.07.039_bib0027","series-title":"Evolutionary computation in combinatorial optimization","first-page":"254","article-title":"A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows","author":"Hashimoto","year":"2008"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0028","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-010-0144-6","article-title":"Recent progress of local search in handling the time window constraints of the vehicle routing problem","volume":"8","author":"Hashimoto","year":"2010","journal-title":"4OR-A Quarterly Journal of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0029","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-012-1264-5","article-title":"Recent progress of local search in handling the time window constraints of the vehicle routing problem","volume":"204","author":"Hashimoto","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0030","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.2019.0912","article-title":"Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows","volume":"54","author":"Hoogeboom","year":"2020","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0031","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/trsc.1030.0085","article-title":"Effective local search algorithms for routing and scheduling problems with general time-window constraints","volume":"39","author":"Ibaraki","year":"2005","journal-title":"Transportation Science"},{"issue":"11","key":"10.1016\/j.ejor.2022.07.039_bib0032","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1016\/j.dam.2007.04.022","article-title":"An iterated local search algorithm for the vehicle routing problem with convex time penalty functions","volume":"156","author":"Ibaraki","year":"2008","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"10.1016\/j.ejor.2022.07.039_bib0033","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","article-title":"Sequential search and its application to vehicle-routing problems","volume":"33","author":"Irnich","year":"2006","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2022.07.039_bib0034","article-title":"Just-in-time scheduling models and algorithms for computer and manufacturing systems","volume":"vol. 106","author":"Jozefowska","year":"2007"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0035","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3141\/1733-01","article-title":"Genetic algorithm for a pickup and delivery problem with time windows","volume":"1733","author":"Jung","year":"2000","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"key":"10.1016\/j.ejor.2022.07.039_bib0036","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.trb.2016.12.022","article-title":"Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery","volume":"99","author":"Kafle","year":"2017","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0037","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.cie.2007.08.004","article-title":"A heuristic for the vehicle routing problem with due times","volume":"54","author":"Kang","year":"2008","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0038","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","article-title":"A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem","volume":"158","author":"Kara","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.07.039_sbref0039","series-title":"Local search in combinatorial optimization","first-page":"337","article-title":"Vehicle routing: Handling edge exchanges","author":"Kindervater","year":"2018"},{"key":"10.1016\/j.ejor.2022.07.039_bib0040","doi-asserted-by":"crossref","first-page":"104987","DOI":"10.1016\/j.cor.2020.104987","article-title":"A review of vehicle routing with simultaneous pickup and delivery","volume":"122","author":"Ko\u00e7","year":"2020","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0041","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","article-title":"An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints","volume":"26","author":"Koskosidis","year":"1992","journal-title":"Transportation Science"},{"issue":"12","key":"10.1016\/j.ejor.2022.07.039_bib0042","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1080\/00207549508904877","article-title":"Scheduling of storage-retrieval orders under a just-in-time environment","volume":"33","author":"Lee","year":"1995","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2022.07.039_bib0043","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.trd.2016.04.005","article-title":"Just-in-time delivery for green fleets: A feedback control approach","volume":"46","author":"Lee","year":"2016","journal-title":"Transportation Research Part D: Transport and Environment"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0044","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2022.07.039_bib0045","series-title":"Hybrid metaheuristics","first-page":"32","article-title":"Variable neighbourhood descent with memory: A hybrid metaheuristic for supermarket resupply","volume":"vol. 9668","author":"Mourdjis","year":"2016"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0046","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10479-011-0947-7","article-title":"Disrupted capacitated vehicle routing problem with order release delay","volume":"207","author":"Mu","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0047","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","article-title":"A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows","volume":"37","author":"Nagata","year":"2010","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0048","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","article-title":"Solving the pickup and delivery problem with time windows using reactive tabu search","volume":"34","author":"Nanry","year":"2000","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0049","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0050","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"8","key":"10.1016\/j.ejor.2022.07.039_bib0051","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.07.039_sbref0052","series-title":"Handbook of metaheuristics","first-page":"99","article-title":"Large neighborhood search","author":"Pisinger","year":"2019"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0053","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"},{"key":"10.1016\/j.ejor.2022.07.039_bib0054","doi-asserted-by":"crossref","first-page":"106803","DOI":"10.1016\/j.cie.2020.106803","article-title":"Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review","volume":"149","author":"Rolim","year":"2020","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0055","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","article-title":"Models and branch-and-cut algorithms for pickup and delivery problems with time windows","volume":"49","author":"Ropke","year":"2007","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0056","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":"2","key":"10.1016\/j.ejor.2022.07.039_bib0057","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problem with time windows: Minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0058","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2013.0490","article-title":"The electric vehicle-routing problem with time windows and recharging stations","volume":"48","author":"Schneider","year":"2014","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2022.07.039_bib0059","series-title":"Principles and practice of constraint programming \u2014 CP98","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"4","key":"10.1016\/j.ejor.2022.07.039_bib0060","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1287\/ijoc.2017.0756","article-title":"The vehicle routing problem with release and due dates","volume":"29","author":"Shelbourne","year":"2017","journal-title":"Informs Journal on Computing"},{"key":"10.1016\/j.ejor.2022.07.039_bib0061","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":"Opererations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0062","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/net.3230160205","article-title":"On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints","volume":"16","author":"Solomon","year":"1986","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0063","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","article-title":"Time window constrained routing and scheduling problems","volume":"22","author":"Solomon","year":"1988","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2022.07.039_bib0064","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.eswa.2020.113302","article-title":"A scatter search method for heterogeneous fleet vehicle routing problem with release dates under lateness dependent tardiness costs","volume":"150","author":"Soman","year":"2020","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2022.07.039_bib0065","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2022.07.039_bib0066","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","article-title":"The vehicle routing problem","author":"Toth","year":"2002"},{"key":"10.1016\/j.ejor.2022.07.039_bib0067","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973594"},{"issue":"1","key":"10.1016\/j.ejor.2022.07.039_bib0068","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.07.039_bib0069","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","article-title":"A unified solution framework for multi-attribute vehicle routing problems","volume":"234","author":"Vidal","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.07.039_bib0070","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"},{"key":"10.1016\/j.ejor.2022.07.039_bib0071","series-title":"Metaheuristic search concepts: A tutorial with applications to production and logistics","author":"Z\u00e4pfel","year":"2010"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722006075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722006075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T16:59:31Z","timestamp":1690822771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221722006075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["S0377221722006075"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2022.07.039","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing earliness-tardiness costs in supplier networks\u2014A just-in-time truck routing problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2022.07.039","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}