{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T10:22:04Z","timestamp":1775211724377,"version":"3.50.1"},"reference-count":94,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10288-020-00433-2","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T17:02:31Z","timestamp":1583514151000},"page":"129-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":78,"title":["Vehicle routing problems over time: a survey"],"prefix":"10.1007","volume":"18","author":[{"given":"A.","family":"Mor","sequence":"first","affiliation":[]},{"given":"M. G.","family":"Speranza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,6]]},"reference":[{"key":"433_CR1","doi-asserted-by":"publisher","first-page":"4351","DOI":"10.1080\/00207543.2014.883470","volume":"52","author":"MKI Abdul Rahim","year":"2014","unstructured":"Abdul Rahim MKI, Zhong Y, Aghezzaf E-H, Aouam T (2014) Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates. Int J Prod Res 52:4351\u20134363","journal-title":"Int J Prod Res"},{"key":"433_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ejor.2014.05.043","volume":"239","author":"D Aksen","year":"2014","unstructured":"Aksen D, Kaya O, Salman FS, T\u00fcncel \u00d6 (2014) An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur J Oper Res 239:413\u2013426","journal-title":"Eur J Oper Res"},{"key":"433_CR3","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson H, Hoff A, Christiansen M, Hasle G, L\u00f8kketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515\u20131536","journal-title":"Comput Oper Res"},{"key":"433_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1080\/00207543.2015.1037024","volume":"54","author":"H Andersson","year":"2016","unstructured":"Andersson H, Christiansen M, Desaulniers G (2016) A new decomposition algorithm for a liquefied natural gas inventory routing problem. Int J Prod Res 54:564\u2013578","journal-title":"Int J Prod Res"},{"key":"433_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/j.1475-3995.2011.00811.x","volume":"19","author":"C Archetti","year":"2012","unstructured":"Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Int Trans Oper Res 19:3\u201322","journal-title":"Int Trans Oper Res"},{"key":"433_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1111\/itor.12226","volume":"23","author":"C Archetti","year":"2016","unstructured":"Archetti C, Speranza MG (2016) The inventory routing problem: the value of integration. Int Trans Oper Res 23:393\u2013407","journal-title":"Int Trans Oper Res"},{"key":"433_CR7","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/trsc.1050.0117","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transp Sci 40:226\u2013234","journal-title":"Transp Sci"},{"key":"433_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp Sci 41:382\u2013391","journal-title":"Transp Sci"},{"key":"433_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/itor.12076","volume":"21","author":"C Archetti","year":"2014","unstructured":"Archetti C, Bianchessi N, Irnich S, Speranza MG (2014a) Formulations for an inventory routing problem. Int Trans Oper Res 21:353\u2013374","journal-title":"Int Trans Oper Res"},{"key":"433_CR10","doi-asserted-by":"crossref","unstructured":"Archetti C, Speranza MG, Vigo D (2014b)Chapter 10: vehicle routing problems with profits. In: Vehicle routing: problems, methods, and applications, 2nd ed., pp 273\u2013297. SIAM","DOI":"10.1137\/1.9781611973594.ch10"},{"key":"433_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2015.06.057","volume":"247","author":"C Archetti","year":"2015","unstructured":"Archetti C, Feillet D, Speranza MG (2015a) Complexity of routing problems with release dates. Eur J Oper Res 247:797\u2013803","journal-title":"Eur J Oper Res"},{"key":"433_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.cor.2015.03.014","volume":"61","author":"C Archetti","year":"2015","unstructured":"Archetti C, Jabali O, Speranza MG (2015b) Multi-period vehicle routing problem with due dates. Comput Oper Res 61:122\u2013134","journal-title":"Comput Oper Res"},{"key":"433_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2017.03.008","volume":"85","author":"C Archetti","year":"2017","unstructured":"Archetti C, Fern\u00e1ndez E, Huerta-Mu\u00f1oz DL (2017) The flexible periodic vehicle routing problem. Comput Oper Res 85:58\u201370","journal-title":"Comput Oper Res"},{"key":"433_CR14","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ejor.2018.01.010","volume":"268","author":"C Archetti","year":"2018","unstructured":"Archetti C, Christiansen M, Speranza MG (2018a) Inventory routing with pickups and deliveries. Eur J Oper Res 268:314\u2013324","journal-title":"Eur J Oper Res"},{"key":"433_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2018.05.001","volume":"98","author":"C Archetti","year":"2018","unstructured":"Archetti C, Feillet D, Mor A, Speranza MG (2018b) An iterated local search for the traveling salesman problem with release dates and completion time minimization. Comput Oper Res 98:24\u201337","journal-title":"Comput Oper Res"},{"key":"433_CR16","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.ejor.2019.07.062","volume":"280","author":"C Archetti","year":"2020","unstructured":"Archetti C, Feillet D, Mor A, Speranza MG (2020) Dynamic traveling salesman problem with stochastic release dates. Eur J Oper Res 280:832\u2013844","journal-title":"Eur J Oper Res"},{"key":"433_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","volume":"104","author":"A Azadeh","year":"2017","unstructured":"Azadeh A, Elahi S, Farahani MH, Nasirian B (2017) A genetic algorithm-taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput Ind Eng 104:124\u2013133","journal-title":"Comput Ind Eng"},{"key":"433_CR18","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/opre.1100.0875","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Bartolini E, Mingozzi A, Valletta A (2011) An exact algorithm for the period routing problem. Oper Res 59:228\u2013241","journal-title":"Oper Res"},{"key":"433_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.cor.2014.08.008","volume":"55","author":"T Bekta\u015f","year":"2015","unstructured":"Bekta\u015f T, Laporte G, Vigo D (2015) Integrated vehicle routing problems. Comput Oper Res 55:126","journal-title":"Comput Oper Res"},{"key":"433_CR20","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/inte.13.6.4","volume":"13","author":"WJ Bell","year":"1983","unstructured":"Bell WJ, Dalberto LM, Fisher ML, Greenfield AJ, Jaikumar R, Kedia P, Mack RG, Prutzman PJ (1983) Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13:4\u201323","journal-title":"Interfaces"},{"key":"433_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"EJ Beltrami","year":"1974","unstructured":"Beltrami EJ, Bodin LD (1974) Networks and vehicle routing for municipal waste collection. Networks 4:65\u201394","journal-title":"Networks"},{"key":"433_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s13676-012-0016-7","volume":"1","author":"L Bertazzi","year":"2012","unstructured":"Bertazzi L, Speranza MG (2012) Inventory routing problems: an introduction. EURO J Transp Logist 1:307\u2013326","journal-title":"EURO J Transp Logist"},{"key":"433_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s13676-013-0027-z","volume":"2","author":"L Bertazzi","year":"2013","unstructured":"Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J Transp Logist 2:255\u2013275","journal-title":"EURO J Transp Logist"},{"key":"433_CR24","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.omega.2014.09.010","volume":"56","author":"L Bertazzi","year":"2015","unstructured":"Bertazzi L, Bosco A, Lagan\u00e0 D (2015) Managing stochastic demand in an inventory routing problem with transportation procurement. Omega 56:112\u2013121","journal-title":"Omega"},{"key":"433_CR25","unstructured":"Bertazzi L, Lagan\u00e0 D, Coelho LC, De\u00a0Maio A (2017) The multi-depot inventory routing problem: An application of vendor-management inventory in city logistic. CIRRELT-2017-54"},{"key":"433_CR26","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313","journal-title":"Comput Ind Eng"},{"key":"433_CR27","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2015","unstructured":"Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2015) Rich vehicle routing problem: survey. ACM Comput surv (CSUR) 47:32","journal-title":"ACM Comput surv (CSUR)"},{"key":"433_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/net.21527","volume":"63","author":"AM Campbell","year":"2014","unstructured":"Campbell AM, Wilson JH (2014) Forty years of periodic vehicle routing. Networks 63:2\u201315","journal-title":"Networks"},{"key":"433_CR29","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1057\/s41274-017-0206-7","volume":"69","author":"R Cantu-Funes","year":"2018","unstructured":"Cantu-Funes R, Salazar-Aguilar MA, Boyer V (2018) Multi-depot periodic vehicle routing problem with due dates and time windows. J Oper Res Soc 69:296\u2013306","journal-title":"J Oper Res Soc"},{"key":"433_CR30","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1287\/trsc.2015.0608","volume":"50","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza D, Absi N, Feillet D (2016a) The multi-trip vehicle routing problem with time windows and release dates. Transp Sci 50:676\u2013693","journal-title":"Transp Sci"},{"key":"433_CR31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","volume":"14","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza D, Absi N, Feillet D (2016b) Vehicle routing problems with multiple trips. 4OR 14:223\u2013259","journal-title":"4OR"},{"key":"433_CR32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"Christofides N, Beasley JE (1984) The period routing problem. Networks 14:237\u2013256","journal-title":"Networks"},{"key":"433_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11067-015-9317-3","volume":"17","author":"JC Chu","year":"2017","unstructured":"Chu JC, Yan S, Huang H-J (2017) A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times. Netw Spat Econ 17:41\u201368","journal-title":"Netw Spat Econ"},{"key":"433_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ijpe.2013.11.019","volume":"155","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Laporte G (2014a) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ 155:391\u2013397","journal-title":"Int J Prod Econ"},{"key":"433_CR35","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2014.01.013","volume":"47","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Laporte G (2014b) Optimal joint replenishment, delivery and inventory management policies for perishable products. Comput Oper Res 47:42\u201352","journal-title":"Comput Oper Res"},{"key":"433_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2013) Thirty years of inventory routing. Transp Sci 48:1\u201319","journal-title":"Transp Sci"},{"key":"433_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cor.2014.07.001","volume":"52","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2014) Heuristics for dynamic and stochastic inventory-routing. Comput Oper Res 52:55\u201367","journal-title":"Comput Oper Res"},{"key":"433_CR38","volume-title":"Arc routing: problems, methods, and applications","author":"\u00c1 Corber\u00e1n","year":"2013","unstructured":"Corber\u00e1n \u00c1, Laporte G (2013) Arc routing: problems, methods, and applications. SIAM, New Delhi"},{"key":"433_CR39","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.cor.2014.06.007","volume":"55","author":"J-F Cordeau","year":"2015","unstructured":"Cordeau J-F, Lagan\u00e0 D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput Oper Res 55:153\u2013166","journal-title":"Comput Oper Res"},{"key":"433_CR40","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.2017.0799","volume":"52","author":"Y Crama","year":"2018","unstructured":"Crama Y, Rezaei M, Savelsbergh M, Van Woensel T (2018) Stochastic inventory routing for perishable products. Transp Sci 52:526\u2013546","journal-title":"Transp Sci"},{"key":"433_CR41","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6:80\u201391","journal-title":"Manage Sci"},{"key":"433_CR42","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","volume":"50","author":"G Desaulniers","year":"2015","unstructured":"Desaulniers G, Rakke JG, Coelho LC (2015) A branch-price-and-cut algorithm for the inventory-routing problem. Transp Sci 50:1060\u20131076","journal-title":"Transp Sci"},{"key":"433_CR43","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472\u20131483","journal-title":"Comput Ind Eng"},{"key":"433_CR44","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y, Laporte G (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255:422\u2013441","journal-title":"Eur J Oper Res"},{"key":"433_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin"},{"key":"433_CR46","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ijpe.2016.06.024","volume":"183","author":"G Iassinovskaia","year":"2017","unstructured":"Iassinovskaia G, Limbourg S, Riane F (2017) The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. Int J Prod Econ 183:570\u2013582","journal-title":"Int J Prod Econ"},{"key":"433_CR47","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3141\/2548-10","volume":"2548","author":"DN Jayakumar","year":"2016","unstructured":"Jayakumar DN, Grzybowska H, Rey D, Dixit V (2016) Food rescue and delivery: Heuristic algorithm for periodic unpaired pickup and delivery vehicle routing problem. Transp Res Rec J Transp Res Board 2548:81\u201389","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"433_CR48","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.simpat.2013.11.008","volume":"46","author":"AA Juan","year":"2014","unstructured":"Juan AA, Grasman SE, Caceres-Cruz J, Bekta\u015f T (2014) A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simul Model Pract Theory 46:40\u201352","journal-title":"Simul Model Pract Theory"},{"key":"433_CR49","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/trsc.2016.0682","volume":"52","author":"MA Klapp","year":"2016","unstructured":"Klapp MA, Erera AL, Toriello A (2016) The one-dimensional dynamic dispatch waves problem. Transp Sci 52:402\u2013415","journal-title":"Transp Sci"},{"key":"433_CR50","doi-asserted-by":"publisher","unstructured":"Klapp MA, Erera AL, Toriello A (2018) The dynamic dispatch waves problem for same-day delivery. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2018.05.032","DOI":"10.1016\/j.ejor.2018.05.032"},{"key":"433_CR51","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","volume":"165","author":"P Lacomme","year":"2005","unstructured":"Lacomme P, Prins C, Ramdane-Ch\u00e9rif W (2005) Evolutionary algorithms for periodic arc routing problems. Eur J Oper Res 165:535\u2013553","journal-title":"Eur J Oper Res"},{"key":"433_CR52","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1515\/ijfe-2015-0052","volume":"11","author":"D Lagan\u00e0","year":"2015","unstructured":"Lagan\u00e0 D, Longo F, Santoro F (2015) Multi-product inventory-routing problem in the supermarket distribution industry. Int J Food Eng 11:747\u2013766","journal-title":"Int J Food Eng"},{"key":"433_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241:1\u201314","journal-title":"Eur J Oper Res"},{"key":"433_CR54","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43:408\u2013416","journal-title":"Transp Sci"},{"key":"433_CR55","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.ejor.2013.07.034","volume":"236","author":"K Li","year":"2014","unstructured":"Li K, Chen B, Sivakumar AI, Wu Y (2014) An inventory-routing problem with the objective of travel time minimization. Eur J Oper Res 236:936\u2013945","journal-title":"Eur J Oper Res"},{"key":"433_CR56","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1080\/0305215X.2016.1188092","volume":"49","author":"L Liu","year":"2017","unstructured":"Liu L, Li K, Liu Z (2017) A capacitated vehicle routing problem with order available time in e-commerce industry. Eng Optim 49:449\u2013465","journal-title":"Eng Optim"},{"key":"433_CR57","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tre.2018.05.009","volume":"116","author":"S Liu","year":"2018","unstructured":"Liu S, Qin S, Zhang R (2018) A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Transp Res Part E Logist Transp Rev 116:25\u201341","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"433_CR58","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00170-015-8081-3","volume":"85","author":"S-C Liu","year":"2016","unstructured":"Liu S-C, Lu M-C, Chung C-H (2016) A hybrid heuristic method for the periodic inventory routing problem. Int J Adv Manuf Technol 85:2345\u20132352","journal-title":"Int J Adv Manuf Technol"},{"key":"433_CR59","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1016\/j.wasman.2014.05.011","volume":"34","author":"M Mes","year":"2014","unstructured":"Mes M, Schutten M, Rivera AP (2014) Inventory routing for dynamic waste collection. Waste Manage (Oxford) 34:1564\u20131576","journal-title":"Waste Manage (Oxford)"},{"key":"433_CR60","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00170-013-5501-0","volume":"71","author":"M Mirabi","year":"2014","unstructured":"Mirabi M (2014) A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem. Int J Adv Manuf Technol 71:509\u2013518","journal-title":"Int J Adv Manuf Technol"},{"key":"433_CR61","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.cor.2013.06.006","volume":"52","author":"A Mjirda","year":"2014","unstructured":"Mjirda A, Jarboui B, Macedo R, Hanafi S, Mladenovi\u0107 N (2014) A two phase variable neighborhood search for the multi-product inventory routing problem. Comput Oper Res 52:291\u2013299","journal-title":"Comput Oper Res"},{"key":"433_CR62","unstructured":"Montagn\u00e9 R, Gamache M, Gendreau M (2018) A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection. J Oper Res Soc, pp. 1\u201312"},{"key":"433_CR63","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10696-017-9287-5","volume":"30","author":"S Moons","year":"2018","unstructured":"Moons S, Ramaekers K, Caris A, Arda Y (2018) Integration of order picking and vehicle routing in a b2c e-commerce context. Flex Serv Manuf J 30:813\u2013843","journal-title":"Flex Serv Manuf J"},{"key":"433_CR64","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10732-014-9244-3","volume":"20","author":"PK Nguyen","year":"2014","unstructured":"Nguyen PK, Crainic TG, Toulouse M (2014) A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J Heuristics 20:383\u2013416","journal-title":"J Heuristics"},{"key":"433_CR65","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s10479-015-2001-7","volume":"253","author":"PK Nguyen","year":"2017","unstructured":"Nguyen PK, Crainic TG, Toulouse M (2017) Multi-trip pickup and delivery problem with time windows and synchronization. Ann Oper Res 253:899\u2013934","journal-title":"Ann Oper Res"},{"key":"433_CR66","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tre.2015.04.010","volume":"80","author":"F Niakan","year":"2015","unstructured":"Niakan F, Rahimi M (2015) A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transp Res Part E Logist Transp Rev 80:74\u201394","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"433_CR67","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/mcda.1519","volume":"21","author":"PC Nolz","year":"2014","unstructured":"Nolz PC, Absi N, Feillet D (2014a) A bi-objective inventory routing problem for sustainable waste management under uncertainty. J Multi-Criteria Decis Anal 21:299\u2013314","journal-title":"J Multi-Criteria Decis Anal"},{"key":"433_CR68","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/net.21523","volume":"63","author":"PC Nolz","year":"2014","unstructured":"Nolz PC, Absi N, Feillet D (2014b) A stochastic inventory routing problem for infectious medical waste collection. Networks 63:82\u201395","journal-title":"Networks"},{"key":"433_CR69","doi-asserted-by":"publisher","unstructured":"Noor NM, Shuib A (2015) Multi-depot instances for inventory routing problem using clustering techniques. J Ind Intell Inf. https:\/\/doi.org\/10.12720\/jiii.3.2.97-101","DOI":"10.12720\/jiii.3.2.97-101"},{"key":"433_CR70","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.measurement.2014.10.024","volume":"62","author":"N Norouzi","year":"2015","unstructured":"Norouzi N, Sadegh-Amalnick M, Alinaghiyan M (2015) Evaluating of the particle swarm optimization in a periodic vehicle routing problem. Measurement 62:162\u2013169","journal-title":"Measurement"},{"key":"433_CR71","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1287\/trsc.2014.0542","volume":"49","author":"DJ Papageorgiou","year":"2014","unstructured":"Papageorgiou DJ, Cheon M-S, Nemhauser G, Sokol J (2014a) Approximate dynamic programming for a class of long-horizon maritime inventory routing problems. Transp Sci 49:870\u2013885","journal-title":"Transp Sci"},{"key":"433_CR72","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1287\/ijoc.2014.0601","volume":"26","author":"DJ Papageorgiou","year":"2014","unstructured":"Papageorgiou DJ, Keha AB, Nemhauser GL, Sokol J (2014b) Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS J Comput 26:825\u2013847","journal-title":"INFORMS J Comput"},{"key":"433_CR73","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.eswa.2016.01.041","volume":"53","author":"Y-B Park","year":"2016","unstructured":"Park Y-B, Yoo J-S, Park H-S (2016) A genetic algorithm for the vendor-managed inventory routing problem with lost sales. Expert Syst Appl 53:149\u2013159","journal-title":"Expert Syst Appl"},{"key":"433_CR74","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.eswa.2013.07.100","volume":"41","author":"L Qin","year":"2014","unstructured":"Qin L, Miao L, Ruan Q, Zhang Y (2014) A local search method for periodic inventory routing problem. Expert Syst Appl 41:765\u2013778","journal-title":"Expert Syst Appl"},{"key":"433_CR75","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tre.2017.03.001","volume":"101","author":"M Rahimi","year":"2017","unstructured":"Rahimi M, Baboli A, Rekik Y (2017) Multi-objective inventory routing problem: a stochastic model to consider profit, service level and green criteria. Transp Res Part E Logist Transp Rev 101:59\u201383","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"433_CR76","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.cor.2014.07.004","volume":"53","author":"A Rahimi-Vahed","year":"2015","unstructured":"Rahimi-Vahed A, Crainic TG, Gendreau M, Rei W (2015) Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput Oper Res 53:9\u201323","journal-title":"Comput Oper Res"},{"key":"433_CR77","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ejor.2017.09.020","volume":"266","author":"D Reyes","year":"2018","unstructured":"Reyes D, Erera AL, Savelsbergh MWP (2018) Complexity of routing problems with release dates and deadlines. Eur J Oper Res 266:29\u201334","journal-title":"Eur J Oper Res"},{"key":"433_CR78","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.21562","volume":"64","author":"J-P Riquelme-Rodr\u00edguez","year":"2014","unstructured":"Riquelme-Rodr\u00edguez J-P, Langevin A, Gamache M (2014) Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. Networks 64:125\u2013139","journal-title":"Networks"},{"key":"433_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230090102","volume":"9","author":"R Russell","year":"1979","unstructured":"Russell R, Igo W (1979) An assignment routing problem. Networks 9:1\u201317","journal-title":"Networks"},{"key":"433_CR80","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s00291-018-0517-3","volume":"40","author":"D Schubert","year":"2018","unstructured":"Schubert D, Scholz A, W\u00e4scher G (2018) Integrated order picking and vehicle routing with due dates. OR Spectr 40:1109\u20131139","journal-title":"OR Spectr"},{"key":"433_CR81","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cie.2016.07.022","volume":"99","author":"H Shaabani","year":"2016","unstructured":"Shaabani H, Kamalabadi IN (2016) An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Comput Ind Eng 99:189\u2013201","journal-title":"Comput Ind Eng"},{"key":"433_CR82","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1287\/ijoc.2017.0756","volume":"29","author":"BC Shelbourne","year":"2017","unstructured":"Shelbourne BC, Battarra M, Potts CN (2017) The vehicle routing problem with release and due dates. INFORMS J Comput 29:705\u2013723","journal-title":"INFORMS J Comput"},{"key":"433_CR83","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.cor.2016.02.003","volume":"89","author":"M Soysal","year":"2018","unstructured":"Soysal M, Bloemhof-Ruwaard JM, Haijema R, van der Vorst JGAJ (2018) Modeling a green inventory routing problem for perishable products with horizontal collaboration. Comput Oper Res 89:168\u2013182","journal-title":"Comput Oper Res"},{"key":"433_CR84","doi-asserted-by":"publisher","first-page":"417","DOI":"10.3934\/naco.2017026","volume":"7","author":"EB Tirkolaee","year":"2017","unstructured":"Tirkolaee EB, Goli A, Bakhsi M, Mahdavi I (2017) A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows. Numer Algebra Control Optim 7:417\u2013433","journal-title":"Numer Algebra Control Optim"},{"key":"433_CR85","doi-asserted-by":"publisher","unstructured":"Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2018) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng. https:\/\/doi.org\/10.1016\/j.compeleceng.2018.01.040","DOI":"10.1016\/j.compeleceng.2018.01.040"},{"key":"433_CR86","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: problems, methods, and applications","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, vol 18. SIAM, New Delhi"},{"key":"433_CR87","unstructured":"Ulmer MW, Thomas BW, Mattfeld DC (2016) Preemptive depot returns for a dynamic same-day delivery problem. Technical Report, Technische Universit\u00e4t Braunschweig, pp 1\u201339"},{"key":"433_CR88","unstructured":"Ulmer MW, Thomas BW, Campbell AM, Woyak N (2017) The restaurant meal delivery problem: dynamic pick-up and delivery with deadlines and random ready times"},{"key":"433_CR89","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1287\/trsc.2015.0637","volume":"50","author":"RG Van Anholt","year":"2016","unstructured":"Van Anholt RG, Coelho LC, Laporte G, Vis IFA (2016) An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp Sci 50:1077\u20131091","journal-title":"Transp Sci"},{"key":"433_CR90","doi-asserted-by":"publisher","unstructured":"Voccia SA, Campbell AM, Thomas BW (2017) The same-day delivery problem for online purchases. Transp Sci. https:\/\/doi.org\/10.1287\/trsc.2016.0732","DOI":"10.1287\/trsc.2016.0732"},{"key":"433_CR91","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.cor.2015.12.017","volume":"78","author":"N Wassan","year":"2017","unstructured":"Wassan N, Wassan N, Nagy G, Salhi S (2017) The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search. Comput Oper Res 78:454\u2013467","journal-title":"Comput Oper Res"},{"key":"433_CR92","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/asmb.2291","volume":"33","author":"E Yadollahi","year":"2017","unstructured":"Yadollahi E, Aghezzaf E-H, Raa B (2017) Managing inventory and service levels in a safety stock-based inventory routing system with stochastic retailer demands. Appl Stoch Models Bus Ind 33:369\u2013381","journal-title":"Appl Stoch Models Bus Ind"},{"key":"433_CR93","doi-asserted-by":"publisher","unstructured":"Yahyaoui H, Kaabachi I, Krichen S, Dekdouk A (2018) Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Oper Res, pp 1\u201324. https:\/\/doi.org\/10.1007\/s12351-018-0403-4","DOI":"10.1007\/s12351-018-0403-4"},{"key":"433_CR94","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1016\/j.asoc.2016.09.017","volume":"52","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Mei Y, Tang K, Jiang K (2017) Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Appl Soft Comput 52:1130\u20131142","journal-title":"Appl Soft Comput"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00433-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00433-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00433-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:31:47Z","timestamp":1614990707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00433-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,6]]},"references-count":94,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["433"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00433-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,6]]},"assertion":[{"value":"14 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"We hereby state that we hold no conflicts of interest with respect to the submission of the text to 4OR.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}