{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:49:13Z","timestamp":1772275753024,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":324,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13676-019-00143-8","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:06:23Z","timestamp":1556190383000},"page":"561-595","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6716-2130","authenticated-orcid":false,"given":"Ahmed","family":"Kheiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alina G.","family":"Dragomir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mueller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaquim","family":"Gromicho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Jagtenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelke J.","family":"van Hoorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13676-019-00143-8_bib1","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.ejor.2018.10.022","article-title":"Solving urban transit route design problem using selection hyper-heuristics","volume":"274","author":"Ahmed","year":"2019","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00143-8_bib2","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ins.2014.12.020","article-title":"A tensor-based selection hyper-heuristic for cross-domain heuristic search","volume":"299","author":"Asta","year":"2015","journal-title":"Inf Sci"},{"key":"10.1007\/s13676-019-00143-8_bib3","series-title":"Vehicle Routing","first-page":"161","article-title":"Chapter 6: Pickup-and-Delivery Problems for Goods Transportation","author":"Battarra","year":"2014"},{"issue":"12","key":"10.1007\/s13676-019-00143-8_bib4","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","article-title":"Hyper-heuristics: a survey of the state of the art","volume":"64","author":"Burke","year":"2013","journal-title":"J Oper Res Soc"},{"issue":"4","key":"10.1007\/s13676-019-00143-8_bib5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2013.0472","article-title":"Thirty years of inventory routing","volume":"48","author":"Coelho","year":"2014","journal-title":"Transp Sci"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","article-title":"The dial-a-ride problem: models and algorithms","volume":"153","author":"Cordeau","year":"2007","journal-title":"Ann Oper Res"},{"issue":"6","key":"10.1007\/s13676-019-00143-8_bib8","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling-salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib9","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"},{"key":"10.1007\/s13676-019-00143-8_bib10","unstructured":"Dror M, Fortin D, Roucairol C (1998) Redistribution of self-service electric cars: a case of pickup and delivery. Tech. Rep. RR-3543, INRIA"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: the great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"J Comput Phys"},{"key":"10.1007\/s13676-019-00143-8_bib12","first-page":"1","article-title":"The VeRoLog solver challenge 2016\u20132017","volume":"1","author":"Dullaert","year":"2017","journal-title":"J Veh Rout Algorithms"},{"issue":"10","key":"10.1007\/s13676-019-00143-8_bib13","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1002\/sim.3561","article-title":"The Wilcoxon\u2013Mann\u2013Whitney test under scrutiny","volume":"28","author":"Fagerland","year":"2009","journal-title":"Stat Med"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1080\/01441647.2015.1033036","article-title":"Bikeshare: a review of recent literature","volume":"36","author":"Fishman","year":"2016","journal-title":"Transp Rev"},{"key":"10.1007\/s13676-019-00143-8_bib15","doi-asserted-by":"crossref","unstructured":"Gromicho JA, Haneyah S, Kok L (2015) Solving a real-life vrp with inter-route and intra-route challenges. 10.2139\/ssrn.2610549","DOI":"10.2139\/ssrn.2610549"},{"key":"10.1007\/s13676-019-00143-8_bib16","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (1999) An introduction to variable neighborhood search. In: Meta-heuristics, Springer, pp 433\u2013458","DOI":"10.1007\/978-1-4615-5775-3_30"},{"issue":"2","key":"10.1007\/s13676-019-00143-8_bib17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","article-title":"Evolutionary scheduling: a review","volume":"6","author":"Hart","year":"2005","journal-title":"Genetic Progr Evol Mach"},{"key":"10.1007\/s13676-019-00143-8_bib18","doi-asserted-by":"crossref","unstructured":"Jian N, Freund D, Wiberg HM, Henderson SG (2016) Simulation optimization for a large-scale bike-sharing system. In: Proceedings of the 2016 Winter Simulation Conference, IEEE Press, Piscataway, NJ, USA, WSC '16, pp 602\u2013613","DOI":"10.1109\/WSC.2016.7822125"},{"key":"10.1007\/s13676-019-00143-8_bib19","unstructured":"Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology"},{"key":"10.1007\/s13676-019-00143-8_bib20","doi-asserted-by":"crossref","unstructured":"Kheiri A, Keedwell E (2015) A sequence-based selection hyper-heuristic utilising a hidden Markov model. In: Proceedings of the 2015 on genetic and evolutionary computation conference, GECCO '15, pp 417\u2013424","DOI":"10.1145\/2739480.2754766"},{"issue":"3","key":"10.1007\/s13676-019-00143-8_bib21","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1162\/evco_a_00186","article-title":"A hidden markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems","volume":"25","author":"Kheiri","year":"2017","journal-title":"Evolut Comput"},{"key":"10.1007\/s13676-019-00143-8_bib22","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1016\/j.proeng.2015.08.993","article-title":"Sequence Analysis-based Hyper-heuristics for Water Distribution Network Optimisation","volume":"119","author":"Kheiri","year":"2015","journal-title":"Procedia Engineering"},{"issue":"279","key":"10.1007\/s13676-019-00143-8_bib23","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1080\/01621459.1957.10501395","article-title":"Historical notes on the Wilcoxon unpaired two-sample test","volume":"52","author":"Kruskal","year":"1957","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"10.1007\/s13676-019-00143-8_bib24","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-019-00143-8_bib25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","article-title":"Lower bounds and reduction procedures for the bin packing problem","volume":"28","author":"Martello","year":"1990","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13676-019-00143-8_bib26","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.07.020","article-title":"The dial-a-ride problem with transfers","volume":"41","author":"Masson","year":"2014","journal-title":"Comput Oper Res"},{"issue":"5","key":"10.1007\/s13676-019-00143-8_bib27","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0191-2607(89)90085-X","article-title":"The multiple vehicle routing problem with simultaneous delivery and pick-up points","volume":"23","author":"Min","year":"1989","journal-title":"Transp Res Part A: General"},{"key":"10.1007\/s13676-019-00143-8_bib28","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","article-title":"A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service","volume":"33","author":"Montan\u00e9","year":"2006","journal-title":"Comput OR"},{"key":"10.1007\/s13676-019-00143-8_bib29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"4","key":"10.1007\/s13676-019-00143-8_bib30","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1109\/TITS.2014.2303986","article-title":"Dynamic vehicle redistribution and online price incentives in shared mobility systems","volume":"15","author":"Pfrommer","year":"2014","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"10.1007\/s13676-019-00143-8_bib31","series-title":"Evolutionary computation in combinatorial optimization","first-page":"121","article-title":"Balancing bicycle sharing systems: a variable neighborhood search approach","author":"Rainer-Harbach","year":"2013"},{"issue":"2","key":"10.1007\/s13676-019-00143-8_bib32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.5784\/25-2-78","article-title":"The life and times of the savings method for vehicle routing problems","volume":"25","author":"Rand","year":"2009","journal-title":"ORiON"},{"issue":"10","key":"10.1007\/s13676-019-00143-8_bib33","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1080\/0740817X.2013.770186","article-title":"Optimal inventory management of a bike-sharing station","volume":"45","author":"Raviv","year":"2013","journal-title":"IIE Trans"},{"issue":"12","key":"10.1007\/s13676-019-00143-8_bib34","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","article-title":"Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports","volume":"38","author":"Schilde","year":"2011","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-019-00143-8_bib35","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.ejor.2016.08.029","article-title":"Inventory rebalancing and vehicle routing in bike sharing systems","volume":"257","author":"Schuijbroek","year":"2017","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-019-00143-8_bib36","series-title":"Encyclopedia of operations research and management science","first-page":"960","article-title":"Metaheuristics","author":"S\u00f6rensen","year":"2013"},{"key":"10.1007\/s13676-019-00143-8_bib37","unstructured":"Wall MB (1996) A genetic algorithm for resource-constrained scheduling. PhD thesis, Massachusetts Institute of Technology"},{"key":"10.1007\/s13676-019-00143-8_bib38","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.renene.2018.03.052","article-title":"Evolutionary computation for wind farm layout optimization","volume":"126","author":"Wilson","year":"2018","journal-title":"Renew Energy"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-019-00143-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-019-00143-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300376?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-019-00143-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:54Z","timestamp":1761882234000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["S2192437620300376"],"URL":"https:\/\/doi.org\/10.1007\/s13676-019-00143-8","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-019-00143-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2019 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}