{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:25:36Z","timestamp":1778693136128,"version":"3.51.4"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t Augsburg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To make the last mile of parcel delivery more efficient, service providers offer an increasing number of modes of delivery as alternatives to the traditional and often cost-intensive home delivery service. Parcel lockers and pickup stations can be utilized to reduce the number of stops and avoid costly detours. To design smart delivery networks, service providers must evaluate different business models. In this context, a multitrip vehicle routing problem with delivery options and location-dependent costs arises. We present a data-driven framework to evaluate alternative delivery strategies, formulate a corresponding model and solve the problem heuristically using adaptive large neighborhood search. By examining large, real-life instances from a major European parcel service, we determine the potential and benefits of different delivery options. Specifically, we show that delivery costs can be mitigated by consolidating orders in pickup stations and illustrate how pricing can be applied to steer customer demand toward profitable, eco-friendly products.<\/jats:p>","DOI":"10.1007\/s00291-023-00710-6","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:03:05Z","timestamp":1677726185000},"page":"241-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Multitrip vehicle routing with delivery options: a data-driven application to the parcel industry"],"prefix":"10.1007","volume":"46","author":[{"given":"Lukas","family":"Janinhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-2984","authenticated-orcid":false,"given":"Robert","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"issue":"2","key":"710_CR1","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1057\/rpm.2012.51","volume":"12","author":"N Agatz","year":"2013","unstructured":"Agatz N, Campbell AM, Fleischmann M, van Nunen J, Savelsbergh MWP (2013) Revenue management opportunities for Internet retailers. J Revenue Pricing Manage 12(2):128\u2013138. https:\/\/doi.org\/10.1057\/rpm.2012.51","journal-title":"J Revenue Pricing Manage"},{"issue":"2","key":"710_CR2","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2016.03.049","volume":"254","author":"C Archetti","year":"2016","unstructured":"Archetti C, Savelsbergh MWP, Speranza MG (2016) The vehicle routing problem with occasional drivers. Eur J Oper Res 254(2):472\u2013480. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.049","journal-title":"Eur J Oper Res"},{"key":"710_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/1.9781611973594.ch10","volume-title":"Vehicle routing: problems, methods, and applications","author":"C Archetti","year":"2014","unstructured":"Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications, 2nd edn. SIAM, Philadelphia, pp 273\u2013297. https:\/\/doi.org\/10.1137\/1.9781611973594.ch10","edition":"2"},{"issue":"2","key":"710_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12544-017-0272-6","volume":"10","author":"F Arnold","year":"2018","unstructured":"Arnold F, Cardenas I, S\u00f6rensen K, Dewulf W (2018) Simulation of B2C e-commerce distribution in Antwerp using cargo bikes and delivery points. Eur Transp Res Rev 10(2):135. https:\/\/doi.org\/10.1007\/s12544-017-0272-6","journal-title":"Eur Transp Res Rev"},{"key":"710_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold F, Gendreau M, S\u00f6rensen K (2019) Efficiently solving very large-scale routing problems. Comput Oper Res 107:32\u201342. https:\/\/doi.org\/10.1016\/j.cor.2019.03.006","journal-title":"Comput Oper Res"},{"issue":"3","key":"710_CR6","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2010","unstructured":"Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202(3):756\u2013763. https:\/\/doi.org\/10.1016\/j.ejor.2009.06.034","journal-title":"Eur J Oper Res"},{"issue":"1","key":"710_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10479-011-0991-3","volume":"199","author":"N Azi","year":"2012","unstructured":"Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199(1):103\u2013112. https:\/\/doi.org\/10.1007\/s10479-011-0991-3","journal-title":"Ann Oper Res"},{"key":"710_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","volume":"41","author":"N Azi","year":"2014","unstructured":"Azi N, Gendreau M, Potvin J-Y (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput Oper Res 41:167\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2013.08.016","journal-title":"Comput Oper Res"},{"issue":"7","key":"710_CR9","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1057\/jors.2009.51","volume":"61","author":"R Baldacci","year":"2010","unstructured":"Baldacci R, Bartolini E, Laporte G (2010) Some applications of the generalized vehicle routing problem. J Oper Res Soc 61(7):1072\u20131077. https:\/\/doi.org\/10.1057\/jors.2009.51","journal-title":"J Oper Res Soc"},{"issue":"2","key":"710_CR10","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1287\/trsc.2016.0711","volume":"51","author":"R Baldacci","year":"2017","unstructured":"Baldacci R, Ngueveu SU, Calvo RW (2017) The vehicle routing problem with transshipment facilities. Transp Sci 51(2):592\u2013606. https:\/\/doi.org\/10.1287\/trsc.2016.0711","journal-title":"Transp Sci"},{"key":"710_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00291-013-0338-3","volume":"36","author":"A Baur","year":"2014","unstructured":"Baur A, Klein R, Steinhardt C (2014) Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry. Or Spectrum 36:557\u2013584. https:\/\/doi.org\/10.1007\/s00291-013-0338-3","journal-title":"Or Spectrum"},{"issue":"6","key":"710_CR12","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1287\/mnsc.2021.4069","volume":"68","author":"G Berbeglia","year":"2022","unstructured":"Berbeglia G, Garassino A, Vulcano G (2022) A comparative empirical study of discrete choice models in retail operations. Manage Sci 68(6):4005\u20134023. https:\/\/doi.org\/10.1287\/mnsc.2021.4069","journal-title":"Manage Sci"},{"key":"710_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-020-00607-8","volume":"43","author":"N Boysen","year":"2020","unstructured":"Boysen N, Fedtke S, Schwerdfeger S (2020) Last-mile delivery concepts: a survey from an operational research perspective. Or Spectrum 43:1\u201358. https:\/\/doi.org\/10.1007\/s00291-020-00607-8","journal-title":"Or Spectrum"},{"issue":"3","key":"710_CR14","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 (2016) Vehicle routing problems with multiple trips. 4OR 14(3):223\u2013259. https:\/\/doi.org\/10.1007\/s10288-016-0306-2","journal-title":"4OR"},{"issue":"3","key":"710_CR15","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejor.2013.06.012","volume":"236","author":"D Cattaruzza","year":"2014","unstructured":"Cattaruzza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236(3):833\u2013848. https:\/\/doi.org\/10.1016\/j.ejor.2013.06.012","journal-title":"Eur J Oper Res"},{"issue":"2","key":"710_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/trsc.2019.0914","volume":"54","author":"J Christiaens","year":"2020","unstructured":"Christiaens J, Vanden Berghe G (2020) Slack induction by string removals for vehicle routing problems. Transp Sci 54(2):417\u2013433. https:\/\/doi.org\/10.1287\/trsc.2019.0914","journal-title":"Transp Sci"},{"issue":"3","key":"710_CR17","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2003.08.067","volume":"165","author":"C-W Chu","year":"2005","unstructured":"Chu C-W (2005) A heuristic algorithm for the truckload and less-than-truckload problem. Eur J Oper Res 165(3):657\u2013667. https:\/\/doi.org\/10.1016\/j.ejor.2003.08.067","journal-title":"Eur J Oper Res"},{"key":"710_CR18","unstructured":"DHL (2018) Shortening the last mile: Winning logistics strategies in the race to the urban consumer. https:\/\/www.dhl.com\/global-en\/home\/insights-and-innovation\/insights\/shortening-the-last-mile.html"},{"key":"710_CR19","doi-asserted-by":"publisher","first-page":"105758","DOI":"10.1016\/j.cor.2022.105758","volume":"143","author":"AG Dragomir","year":"2022","unstructured":"Dragomir AG, Van Woensel T, Doerner KF (2022) The pickup and delivery problem with alternative locations and overlapping time windows. Comput Oper Res 143:105758. https:\/\/doi.org\/10.1016\/j.cor.2022.105758","journal-title":"Comput Oper Res"},{"key":"710_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","volume":"144","author":"D Dumez","year":"2021","unstructured":"Dumez D, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2021a) A large neighborhood search approach to the vehicle routing problem with delivery options. Transp Res Part B Methodol 144:103\u2013132. https:\/\/doi.org\/10.1016\/j.trb.2020.11.012","journal-title":"Transp Res Part B Methodol"},{"key":"710_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2021.100040","author":"D Dumez","year":"2021","unstructured":"Dumez D, Tilk C, Irnich S, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2021b) Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO J Transp Logist. https:\/\/doi.org\/10.1016\/j.ejtl.2021.100040","journal-title":"EURO J Transp Logist"},{"key":"710_CR22","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.sbspro.2012.03.126","volume":"39","author":"B Durand","year":"2012","unstructured":"Durand B, Gonzalez-Feliu J (2012) Urban logistics and e-grocery: have proximity delivery services a positive impact on shopping trips? Procedia Soc Behav Sci 39:510\u2013520. https:\/\/doi.org\/10.1016\/j.sbspro.2012.03.126","journal-title":"Procedia Soc Behav Sci"},{"issue":"1","key":"710_CR23","doi-asserted-by":"publisher","first-page":"136","DOI":"10.3141\/2191-17","volume":"2191","author":"J Edwards","year":"2010","unstructured":"Edwards J, McKinnon A, Cherrett T, McLeod F, Song L (2010) Carbon dioxide benefits of using collection\u2013delivery points for failed home deliveries in the United Kingdom. Transp Res Rec J Transp Res Board 2191(1):136\u2013143. https:\/\/doi.org\/10.3141\/2191-17","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"710_CR24","doi-asserted-by":"publisher","first-page":"104919","DOI":"10.1016\/j.cor.2020.104919","volume":"118","author":"DLJU Enthoven","year":"2020","unstructured":"Enthoven DLJU, Jargalsaikhan B, Roodbergen KJ, Uit het Broek MAJ, Schrotenboer AH (2020) The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers. Comput Oper Res 118:104919. https:\/\/doi.org\/10.1016\/j.cor.2020.104919","journal-title":"Comput Oper Res"},{"key":"710_CR25","doi-asserted-by":"publisher","first-page":"105544","DOI":"10.1016\/j.cie.2018.11.054","volume":"139","author":"L Faug\u00e8re","year":"2020","unstructured":"Faug\u00e8re L, Montreuil B (2020) Smart locker bank design optimization for urban omnichannel logistics: assessing monolithic vs. modular configurations. Comput Ind Eng 139:105544. https:\/\/doi.org\/10.1016\/j.cie.2018.11.054","journal-title":"Comput Ind Eng"},{"key":"710_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.04.032","author":"D Fleckenstein","year":"2022","unstructured":"Fleckenstein D, Klein R, Steinhardt C (2022) Recent Advances in integrating demand management and vehicle routing: A methodological review. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2022.04.032","journal-title":"Eur J Oper Res"},{"key":"710_CR27","unstructured":"Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Technical report. University of Hamburg"},{"issue":"6","key":"710_CR28","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1287\/trsc.2019.0909","volume":"53","author":"V Fran\u00e7ois","year":"2019","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y (2019) Adaptive large neighborhood search for multitrip vehicle routing with time windows. Transp Sci 53(6):1706\u20131730. https:\/\/doi.org\/10.1287\/trsc.2019.0909","journal-title":"Transp Sci"},{"key":"710_CR29","doi-asserted-by":"publisher","first-page":"105491","DOI":"10.1016\/j.cor.2021.105491","volume":"137","author":"C Friedrich","year":"2022","unstructured":"Friedrich C, Elbert R (2022) Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics. Comput Oper Res 137:105491. https:\/\/doi.org\/10.1016\/j.cor.2021.105491","journal-title":"Comput Oper Res"},{"issue":"1","key":"710_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","volume":"122","author":"G Ghiani","year":"2000","unstructured":"Ghiani G, Improta G (2000) An efficient transformation of the generalized vehicle routing problem. Eur J Oper Res 122(1):11\u201317. https:\/\/doi.org\/10.1016\/S0377-2217(99)00073-9","journal-title":"Eur J Oper Res"},{"issue":"3","key":"710_CR31","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.ejor.2019.02.008","volume":"280","author":"J G\u00f6nsch","year":"2020","unstructured":"G\u00f6nsch J (2020) How much to tell your customer? A survey of three perspectives on selling strategies with incompletely specified products. Eur J Oper Res 280(3):793\u2013817. https:\/\/doi.org\/10.1016\/j.ejor.2019.02.008","journal-title":"Eur J Oper Res"},{"key":"710_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10100-020-00725-2","volume":"29","author":"J Grabenschweiger","year":"2021","unstructured":"Grabenschweiger J, Doerner KF, Hartl RF, Savelsbergh MWP (2021) The vehicle routing problem with heterogeneous locker boxes. CEJOR 29:113\u2013142. https:\/\/doi.org\/10.1007\/s10100-020-00725-2","journal-title":"CEJOR"},{"issue":"4","key":"710_CR33","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1108\/K-05-2018-0236","volume":"49","author":"Y He","year":"2019","unstructured":"He Y, Wang X, Zhou F, Lin Y (2019) Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery. Kybernetes 49(4):1267\u20131284. https:\/\/doi.org\/10.1108\/K-05-2018-0236","journal-title":"Kybernetes"},{"issue":"3","key":"710_CR34","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s13676-018-0120-4","volume":"8","author":"S Heshmati","year":"2019","unstructured":"Heshmati S, Verstichel J, Esprit E, Vanden Berghe G (2019) Alternative e-commerce delivery policies. EURO J Transp Logist 8(3):217\u2013248. https:\/\/doi.org\/10.1007\/s13676-018-0120-4","journal-title":"EURO J Transp Logist"},{"key":"710_CR35","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tre.2019.09.001","volume":"131","author":"M Janjevic","year":"2019","unstructured":"Janjevic M, Winkenbach M, Merch\u00e1n D (2019) Integrating collection-and-delivery points in the strategic design of urban last-mile e-commerce distribution networks. Transp Res Part e: Logist Transp Rev 131:37\u201367. https:\/\/doi.org\/10.1016\/j.tre.2019.09.001","journal-title":"Transp Res Part e: Logist Transp Rev"},{"issue":"2","key":"710_CR36","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1287\/ijoc.2021.1119","volume":"34","author":"A Jungwirth","year":"2022","unstructured":"Jungwirth A, Desaulniers G, Frey M, Kolisch R (2022) Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity. INFORMS J Comput 34(2):1157\u20131175. https:\/\/doi.org\/10.1287\/ijoc.2021.1119","journal-title":"INFORMS J Comput"},{"issue":"1","key":"710_CR37","first-page":"21","volume":"6","author":"I Karao\u011flan","year":"2015","unstructured":"Karao\u011flan I (2015) A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles. Int J Lean Think 6(1):21\u201346","journal-title":"Int J Lean Think"},{"key":"710_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-61947-3","volume-title":"Smart and sustainable supply chain and logistics-trends, challenges, methods and best practices","author":"A Kawa","year":"2020","unstructured":"Kawa A (2020) Out-of-home delivery as a solution of the last-mile problem in e-commerce. In: Golinska-Dawson P, Tsai K-M, Kosacka-Olejnik M (eds) Smart and sustainable supply chain and logistics-trends, challenges, methods and best practices. Cham, Springer, pp 25\u201340. https:\/\/doi.org\/10.1007\/978-3-030-61947-3"},{"issue":"4598","key":"710_CR39","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"1","key":"710_CR40","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/trsc.2017.0738","volume":"53","author":"R Klein","year":"2019","unstructured":"Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transp Sci 53(1):236\u2013255. https:\/\/doi.org\/10.1287\/trsc.2017.0738","journal-title":"Transp Sci"},{"key":"710_CR41","doi-asserted-by":"publisher","first-page":"105195","DOI":"10.1016\/j.cor.2020.105195","volume":"129","author":"D Lagan\u00e0","year":"2021","unstructured":"Lagan\u00e0 D, Laporte G, Vocaturo F (2021) A dynamic multi-period general routing problem arising in postal service and parcel delivery systems. Comput Oper Res 129:105195. https:\/\/doi.org\/10.1016\/j.cor.2020.105195","journal-title":"Comput Oper Res"},{"key":"710_CR42","unstructured":"Last Mile Experts (2021) Last-mile delivery in Europe 2021. http:\/\/www.lastmileexperts.com\/news-case-studies"},{"key":"710_CR43","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.trpro.2016.11.027","volume":"16","author":"J Lemke","year":"2016","unstructured":"Lemke J, Iwan S, Korczak J (2016) Usability of the parcel lockers from the customer perspective\u2014the research in Polish Cities. Transp Res Procedia 16:272\u2013287. https:\/\/doi.org\/10.1016\/j.trpro.2016.11.027","journal-title":"Transp Res Procedia"},{"key":"710_CR44","doi-asserted-by":"publisher","first-page":"102541","DOI":"10.1016\/j.tre.2021.102541","volume":"157","author":"Y Lin","year":"2022","unstructured":"Lin Y, Wang Y, Lee LH, Chew EP (2022) Profit-maximizing parcel locker location problem under threshold Luce model? Transp Res Part E Logist Transp Rev 157:102541. https:\/\/doi.org\/10.1016\/j.tre.2021.102541","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"710_CR45","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tre.2017.08.007","volume":"121","author":"C Liu","year":"2019","unstructured":"Liu C, Wang Q, Susilo YO (2019) Assessing the impacts of collection-delivery points to individual\u2019s activity-travel patterns: a greener last mile alternative? Transp Res Part E Logist Transp Rev 121:84\u201399. https:\/\/doi.org\/10.1016\/j.tre.2017.08.007","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"710_CR46","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.cie.2019.01.048","volume":"129","author":"J Mackert","year":"2019","unstructured":"Mackert J (2019) Choice-based dynamic time slot management in attended home delivery. Comput Ind Eng 129:333\u2013345. https:\/\/doi.org\/10.1016\/j.cie.2019.01.048","journal-title":"Comput Ind Eng"},{"key":"710_CR47","doi-asserted-by":"publisher","first-page":"105361","DOI":"10.1016\/j.cor.2021.105361","volume":"133","author":"S Mancini","year":"2021","unstructured":"Mancini S, Gansterer M (2021) Vehicle routing with private and shared delivery locations. Comput Oper Res 133:105361. https:\/\/doi.org\/10.1016\/j.cor.2021.105361","journal-title":"Comput Oper Res"},{"key":"710_CR48","unstructured":"McKinsey & Company (2016) Parcel delivery. The future of last mile. https:\/\/www.mckinsey.com\/~\/media\/mckinsey\/industries\/travel%20transport%20and%20logistics\/our%20insights\/how%20customer%20demands%20are%20reshaping%20last%20mile%20delivery\/parcel_delivery_the_future_of_last_mile.ashx"},{"key":"710_CR49","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.rtbm.2014.03.002","volume":"11","author":"E Morganti","year":"2014","unstructured":"Morganti E, Dablanc L, Fortin F (2014a) Final deliveries for online shopping: the deployment of pickup point networks in urban and suburban areas. Res Transp Bus Manag 11:23\u201331. https:\/\/doi.org\/10.1016\/j.rtbm.2014.03.002","journal-title":"Res Transp Bus Manag"},{"key":"710_CR50","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.trpro.2014.11.014","volume":"4","author":"E Morganti","year":"2014","unstructured":"Morganti E, Seidel S, Blanquart C, Dablanc L, Lenz B (2014b) The Impact of e-commerce on final deliveries: alternative parcel delivery services in France and Germany. Transp Res Procedia 4:178\u2013190. https:\/\/doi.org\/10.1016\/j.trpro.2014.11.014","journal-title":"Transp Res Procedia"},{"issue":"5","key":"710_CR51","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y Nagata","year":"2009","unstructured":"Nagata Y, Br\u00e4ysy O (2009) A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper Res Lett 37(5):333\u2013338. https:\/\/doi.org\/10.1016\/j.orl.2009.04.006","journal-title":"Oper Res Lett"},{"issue":"5","key":"710_CR52","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s13676-019-00144-7","volume":"8","author":"I Orenstein","year":"2019","unstructured":"Orenstein I, Raviv T, Sadan E (2019) Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis. EURO J Transp Logist 8(5):683\u2013711. https:\/\/doi.org\/10.1007\/s13676-019-00144-7","journal-title":"EURO J Transp Logist"},{"key":"710_CR53","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.trb.2017.02.003","volume":"100","author":"G Ozbaygin","year":"2017","unstructured":"Ozbaygin G, Karasan OE, Savelsbergh MWP, Yaman H (2017) A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transp Res Part B Methodol 100:115\u2013137. https:\/\/doi.org\/10.1016\/j.trb.2017.02.003","journal-title":"Transp Res Part B Methodol"},{"key":"710_CR54","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. Boston, Springer, pp 399\u2013419. https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"issue":"3","key":"710_CR55","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66(3):331\u2013340. https:\/\/doi.org\/10.1016\/0377-2217(93)90221-8","journal-title":"Eur J Oper Res"},{"issue":"12","key":"710_CR56","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routeing problems with time windows. J Oper Res Soc 46(12):1433\u20131446. https:\/\/doi.org\/10.1057\/jors.1995.204","journal-title":"J Oper Res Soc"},{"key":"710_CR57","unstructured":"PricewaterhouseCoopers (2018) Solutions to the parcel dilemma. https:\/\/www.pwc.de\/en\/transport-and-logistics\/solutions-to-the-parcel-dilemma.html"},{"key":"710_CR58","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.trc.2017.04.003","volume":"80","author":"D Reyes","year":"2017","unstructured":"Reyes D, Savelsbergh MWP, Toriello A (2017) Vehicle routing with roaming delivery locations. Transp Res Part C Emerg Technol 80:71\u201391. https:\/\/doi.org\/10.1016\/j.trc.2017.04.003","journal-title":"Transp Res Part C Emerg Technol"},{"key":"710_CR59","unstructured":"Rohmer S, Gendron B (2020) A guide to parcel lockers in last mile distribution: Highlighting challenges and opportunities from an OR perspective. CIRRELT-2020-11"},{"issue":"4","key":"710_CR60","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472. https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp Sci"},{"issue":"2","key":"710_CR61","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/trsc.2016.0675","volume":"50","author":"MWP Savelsbergh","year":"2016","unstructured":"Savelsbergh MWP, van Woensel T (2016) 50th anniversary invited article\u2014city logistics: challenges and opportunities. Transp Sci 50(2):579\u2013590. https:\/\/doi.org\/10.1287\/trsc.2016.0675","journal-title":"Transp Sci"},{"key":"710_CR62","doi-asserted-by":"publisher","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: International conference on principles and practice of constraint programming, pp 417\u2013431. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-49481-2_30","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"1","key":"710_CR63","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-017-2722-x","volume":"273","author":"P Sitek","year":"2019","unstructured":"Sitek P, Wikarek J (2019) Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach. Ann Oper Res 273(1):257\u2013277. https:\/\/doi.org\/10.1007\/s10479-017-2722-x","journal-title":"Ann Oper Res"},{"key":"710_CR64","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.trpro.2020.03.170","volume":"46","author":"A Snoeck","year":"2020","unstructured":"Snoeck A, Merch\u00e1n D, Winkenbach M (2020) Revenue management in last-mile delivery: state-of-the-art and future research directions. Transp Res Procedia 46:109\u2013116. https:\/\/doi.org\/10.1016\/j.trpro.2020.03.170","journal-title":"Transp Res Procedia"},{"issue":"2","key":"710_CR65","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"issue":"1","key":"710_CR66","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3141\/2097-02","volume":"2097","author":"L Song","year":"2009","unstructured":"Song L, Cherrett T, McLeod F, Guan W (2009) Addressing the last mile problem: transport impacts of collection and delivery points. Transp Res Rec J Transp Res Board 2097(1):9\u201318. https:\/\/doi.org\/10.3141\/2097-02","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"710_CR67","unstructured":"Statista (2020) E-commerce worldwide\u2014Statistics and Facts. https:\/\/www.statista.com\/topics\/871\/online-shopping\/"},{"issue":"3","key":"710_CR68","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejor.2020.03.007","volume":"294","author":"A Strauss","year":"2021","unstructured":"Strauss A, G\u00fclp\u0131nar N, Zheng Y (2021) Dynamic pricing of flexible time slots for attended home delivery. Eur J Oper Res 294(3):1022\u20131041. https:\/\/doi.org\/10.1016\/j.ejor.2020.03.007","journal-title":"Eur J Oper Res"},{"issue":"4","key":"710_CR69","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00291-021-00633-0","volume":"43","author":"C Tilk","year":"2021","unstructured":"Tilk C, Olkis K, Irnich S (2021) The last-mile vehicle routing problem with delivery options. Or Spectrum 43(4):877\u2013904. https:\/\/doi.org\/10.1007\/s00291-021-00633-0","journal-title":"Or Spectrum"},{"key":"710_CR70","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.jbusres.2017.11.033","volume":"88","author":"Y Vakulenko","year":"2018","unstructured":"Vakulenko Y, Hellstr\u00f6m D, Hjort K (2018) What\u2019s in the parcel locker? Exploring customer value in e-commerce last mile delivery. J Bus Res 88:421\u2013427. https:\/\/doi.org\/10.1016\/j.jbusres.2017.11.033","journal-title":"J Bus Res"},{"issue":"3","key":"710_CR71","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624. https:\/\/doi.org\/10.1287\/opre.1120.1048","journal-title":"Oper Res"},{"key":"710_CR72","doi-asserted-by":"publisher","first-page":"102545","DOI":"10.1016\/j.tre.2021.102545","volume":"157","author":"VF Yu","year":"2022","unstructured":"Yu VF, Jodiawan P, Perwira Redi AAN (2022) Crowd-shipping problem with time windows, transshipment nodes, and delivery options. Transp Res Part E Logist Transp Rev 157:102545. https:\/\/doi.org\/10.1016\/j.tre.2021.102545","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"710_CR73","doi-asserted-by":"publisher","first-page":"102391","DOI":"10.10116\/j.tre.2021.102391","volume":"152","author":"Y Yuan","year":"2021","unstructured":"Yuan Y, Cattaruzza D, Ogier M, Semet F, Vigo D (2021) A column generation based heuristic for the generalized vehicle routing problem with time windows. Transp Res Part E Logist Transp Rev 152:102391. https:\/\/doi.org\/10.10116\/j.tre.2021.102391","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"710_CR74","doi-asserted-by":"publisher","unstructured":"Zhang SZ, Lee CKM (2016) Flexible vehicle scheduling for urban last mile logistics: the emerging technology of shared reception box. In: 2016 IEEE international conference on industrial engineering and engineering management, pp 1913\u20131917. https:\/\/doi.org\/10.1109\/IEEM.2016.7798211","DOI":"10.1109\/IEEM.2016.7798211"},{"issue":"2","key":"710_CR75","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.ejor.2017.08.011","volume":"265","author":"L Zhou","year":"2018","unstructured":"Zhou L, Baldacci R, Vigo D, Wang X (2018) A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution. Eur J Oper Res 265(2):765\u2013778. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.011","journal-title":"Eur J Oper Res"},{"issue":"8","key":"710_CR76","doi-asserted-by":"publisher","first-page":"828","DOI":"10.3390\/su8080828","volume":"8","author":"L Zhou","year":"2016","unstructured":"Zhou L, Wang X, Ni L, Lin Y (2016) Location-routing problem with simultaneous home delivery and customer\u2019s pickup for city distribution of online shopping purchases. Sustainability 8(8):828. https:\/\/doi.org\/10.3390\/su8080828","journal-title":"Sustainability"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00710-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-023-00710-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00710-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T16:02:22Z","timestamp":1717257742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-023-00710-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":76,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["710"],"URL":"https:\/\/doi.org\/10.1007\/s00291-023-00710-6","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"17 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}