{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T10:42:38Z","timestamp":1784716958720,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["IR 122\/8-1"],"award-info":[{"award-number":["IR 122\/8-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Johannes Gutenberg-Universit\u00e4t Mainz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers\u2019 delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers\u2019 overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17\u00a0new optimal solutions for the benchmark set for the VRP with roaming delivery locations.<\/jats:p>","DOI":"10.1007\/s00291-021-00633-0","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T08:02:51Z","timestamp":1624262571000},"page":"877-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":72,"title":["The last-mile vehicle routing problem with delivery options"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4906-3160","authenticated-orcid":false,"given":"Christian","family":"Tilk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katharina","family":"Olkis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9383-4546","authenticated-orcid":false,"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"633_CR1","unstructured":"Achterberg T (2007) Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin, Fakult\u00e4t II \u2013 Mathematik und Naturwissenschaften, Berlin, Germany"},{"key":"633_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.04.023","volume":"64","author":"C Archetti","year":"2015","unstructured":"Archetti C, Bianchessi N, Speranza MG (2015) A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Computers Op Res 64:1\u201310","journal-title":"Computers Op Res"},{"issue":"2","key":"633_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/trsc.2014.0528","volume":"50","author":"C Archetti","year":"2016","unstructured":"Archetti C, Campbell AM, Speranza MG (2016) Multicommodity vs. single-commodity routing. Transp Sci 50(2):461\u2013472","journal-title":"Transp Sci"},{"issue":"5","key":"633_CR4","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Op Res 59(5):1269\u20131283","journal-title":"Op Res"},{"issue":"5","key":"633_CR5","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","volume":"48","author":"JM Belenguer","year":"2000","unstructured":"Belenguer JM, Martinez MC, Mota E (2000) A lower bound for the split delivery vehicle routing problem. Op Res 48(5):801\u2013810","journal-title":"Op Res"},{"key":"633_CR6","unstructured":"BIEK (2019). KEP-Studie 2019: Analyse des Marktes in Deutschland: Clever verpackt, effizient zugestellt. Bundesverband Paket und Expresslogistik e. V. (BIEK) press report, 2019-26-06, https:\/\/www.biek.de\/presse\/meldung\/kep-studie-2019.html, Berlin, Germany (in German)"},{"key":"633_CR7","unstructured":"Cardeneo A, (2005). Modellierung und Optimierung des B2C-Tourenplanungsproblems mit alternativen Lieferorten und -zeiten: Zugl.: Karlsruhe, Univ., Diss., (2005) volume 66 of Wissenschaftliche Berichte des Institutes f\u00fcr F\u00f6rdertechnik und Logistiksysteme der Universit\u00e4t Karlsruhe (TH). Universit\u00e4tsverlag, Karlsruhe, Germany (in German)"},{"key":"633_CR8","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transp Sci 53:946\u2013985","journal-title":"Transp Sci"},{"key":"633_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet Management and Logistics","author":"G Desaulniers","year":"1998","unstructured":"Desaulniers G, Desrosiers J, Ioachim I, Solomon MM, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic TG, Laporte G (eds) Fleet Management and Logistics. Kluwer, Boston, MA, pp 57\u201393"},{"key":"633_CR10","volume-title":"Column Generation","year":"2005","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (eds) (2005) Column Generation. Springer, New York"},{"key":"633_CR11","unstructured":"DHL (2014). Logistics Trend Radar: Delivering Insight today. Creating value tomorrow! https:\/\/post-und-telekommunikation.de\/PuT\/1Fundus\/Dokumente\/Studien\/Deutsche_Post\/2014-DHL_Logistics-TrendRadar_2014.pdf, DHL Trend Research, Troisdorf, Germany"},{"issue":"9","key":"633_CR12","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2007.02.012","volume":"35","author":"KF Doerner","year":"2008","unstructured":"Doerner KF, Gronalt M, Hartl RF, Kiechle G, Reimann M (2008) Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Computers Op Res 35(9):3034\u20133048","journal-title":"Computers Op Res"},{"issue":"3","key":"633_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl M (2012) Synchronization in vehicle routing a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297\u2013316","journal-title":"Transp Sci"},{"key":"633_CR14","doi-asserted-by":"publisher","first-page":"104919","DOI":"10.1016\/j.cor.2020.104919","volume":"118","author":"DL Enthoven","year":"2020","unstructured":"Enthoven DL, 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. Computers Op Res 118:104919","journal-title":"Computers Op Res"},{"issue":"4","key":"633_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1287\/trsc.1040.0106","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) The profitable arc tour problem: Solution with a branch-and-price algorithm. Transp Sci 39(4):539\u2013552","journal-title":"Transp Sci"},{"issue":"4","key":"633_CR16","first-page":"239","volume":"45","author":"D Feillet","year":"2007","unstructured":"Feillet D, Gendreau M, Rousseau L-M (2007) New refinements for the solution of vehicle routing problems with branch and price. INFOR 45(4):239\u2013256","journal-title":"INFOR"},{"key":"633_CR17","series-title":"Lecture notes in Logistics","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-29821-0_11","volume-title":"Logistics management","author":"V Felch","year":"2019","unstructured":"Felch V, Karl D, Asdecker B, Niedermaier A, Sucky E (2019) Reconfiguration of the last mile: consumer acceptance of alternative delivery concepts. In: Bierwirth C, Kirschstein T, Sackmann D (eds) Logistics management, vol 13. Lecture notes in Logistics. Springer International Publishing, Cham, pp 157\u2013171"},{"key":"633_CR18","unstructured":"Furchheim, G., Wenk-Fischer, C., and Gro\u00df-Albenhausen, M. (2020). E-Commerce \u2014 Rekordwachstum, Nachhaltigkeit, Globalisierung & Plattform. Presentation of bevh (Bundesverband E-Commerce und Versandhandel Deutschland e.V.). https:\/\/www.bevh.org\/fileadmin\/content\/05_presse\/Pressemitteilungen_2020\/200121_-_Pra__sentaion_fu__r_PK_FINAL.pdf, Berlin, Germany (in German)"},{"issue":"1","key":"633_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/jors.2012.32","volume":"64","author":"A Ghoniem","year":"2013","unstructured":"Ghoniem A, Scherrer CR, Solak S (2013) A specialized column generation approach for a vehicle routing problem with demand allocation. J Op Res Soc 64(1):114\u2013124","journal-title":"J Op Res Soc"},{"issue":"1","key":"633_CR20","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. Cent Eur J Op Res 29(1):113\u2013142","journal-title":"Cent Eur J Op Res"},{"issue":"1","key":"633_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejor.2019.04.008","volume":"278","author":"T Gschwind","year":"2019","unstructured":"Gschwind T, Bianchessi N, Irnich S (2019) Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur J Op Res 278(1):91\u2013104","journal-title":"Eur J Op Res"},{"issue":"1","key":"633_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","volume":"27","author":"M Hachicha","year":"2000","unstructured":"Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Computers Op Res 27(1):29\u201342","journal-title":"Computers Op Res"},{"issue":"4","key":"633_CR23","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","journal-title":"Kybernetes"},{"key":"633_CR24","doi-asserted-by":"publisher","first-page":"106513","DOI":"10.1016\/j.cie.2020.106513","volume":"145","author":"Y He","year":"2020","unstructured":"He Y, Qi M, Zhou F, Su J (2020) An effective metaheuristic for the last mile delivery with roaming delivery locations and stochastic travel times. Computers Indus Eng 145:106513","journal-title":"Computers Indus Eng"},{"key":"633_CR25","series-title":"Operations research\/computer science interfaces","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-0-387-77778-8_19","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"C Hempsch","year":"2008","unstructured":"Hempsch C, Irnich S (2008) Vehicle routing problems with inter-tour resource constraints. In: Golden BL, Raghavan R, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Operations research\/computer science interfaces. Springer, US, pp 421\u2013444"},{"key":"633_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column generation","author":"S Irnich","year":"2005","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, New York, NY, pp 33\u201365"},{"key":"633_CR27","first-page":"1","volume":"1","author":"S Irnich","year":"2014","unstructured":"Irnich S, Toth P, Vigo D (2014) The family of vehicle routing problems in vehicle routing. Soc Indus Appl Math (SIAM) 1:1\u201333","journal-title":"Soc Indus Appl Math (SIAM)"},{"key":"633_CR28","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","journal-title":"Transp Res Part E: Logist Transp Rev"},{"issue":"2","key":"633_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ejor.2009.11.014","volume":"204","author":"R Jans","year":"2010","unstructured":"Jans R (2010) Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems. Eur J Op Res 204(2):251\u2013254","journal-title":"Eur J Op Res"},{"issue":"2","key":"633_CR30","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Op Res 56(2):497\u2013511","journal-title":"Op Res"},{"key":"633_CR31","unstructured":"Jungwirth A, Desaulniers G, Frey M, Kolisch R (2020a) Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity. Les Cahiers du GERAD G-2020-44, \u00c9cole des Hautes \u00c9tudes Commerciales, Montr\u00e9al, Canada"},{"key":"633_CR32","unstructured":"Jungwirth A, Frey M, Kolisch R (2020b). The vehicle routing problem with time windows, flexibleservice locations and time-dependent location capacity. TUM Technical Report OM-2020-01, TUM School of Management, Munich, Germany"},{"issue":"1","key":"633_CR33","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101\u2013116","journal-title":"Transp Sci"},{"key":"633_CR34","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.trpro.2018.09.019","volume":"30","author":"A Lombard","year":"2018","unstructured":"Lombard A, Tamayo-Giraldo S, Fontane F (2018) Vehicle routing problem with roaming delivery locations and stochastic travel times (VRPRDL-S). Transp Res Procedia 30:167\u2013177","journal-title":"Transp Res Procedia"},{"key":"633_CR35","series-title":"Lecture notes in logistics","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-74225-0_11","volume-title":"Dynamics in logistics","author":"J Los","year":"2018","unstructured":"Los J, Spaan MTJ, Negenborn RR (2018) Fleet management for pickup and delivery problems with multiple locations and preferences. In: Freitag M, Kotzab H, Pannek J (eds) Dynamics in logistics, vol 61. Lecture notes in logistics. Springer, Cham, pp 86\u201394"},{"key":"633_CR36","doi-asserted-by":"crossref","unstructured":"Mancini S, Gansterer M (2021) Vehicle routing with private and shared delivery locations. Comput Operations Res 133:105361","DOI":"10.1016\/j.cor.2021.105361"},{"issue":"1","key":"633_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","volume":"259","author":"D Manerba","year":"2017","unstructured":"Manerba D, Mansini R, Riera-Ledesma J (2017) The traveling purchaser problem and its variants. Eur J Op Res 259(1):1\u201318","journal-title":"Eur J Op Res"},{"issue":"2","key":"633_CR38","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1057\/jors.2011.25","volume":"63","author":"L Moccia","year":"2012","unstructured":"Moccia L, Cordeau J-F, Laporte G (2012) An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J Op Res Soc 63(2):232\u2013244","journal-title":"J Op Res Soc"},{"issue":"5","key":"633_CR39","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","journal-title":"EURO J Transp Logist"},{"key":"633_CR40","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, Ekin Karasan O, Savelsbergh M, 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","journal-title":"Transp Res Part B: Methodol"},{"issue":"3","key":"633_CR41","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin D, Contardo C, Desaulniers G, Uchoa E (2017) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J Comput 29(3):489\u2013502","journal-title":"INFORMS J Comput"},{"issue":"2\u20133","key":"633_CR42","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs TK, Kopman L, Pulleyblank WR, Trotter L (2003) On the capacitated vehicle routing problem. Math Program 94(2\u20133):343\u2013359","journal-title":"Math Program"},{"issue":"5","key":"633_CR43","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1057\/s41274-017-0220-9","volume":"69","author":"M Reihaneh","year":"2017","unstructured":"Reihaneh M, Ghoniem A (2017) A multi-start optimization-based heuristic for a food bank distribution problem. J Op Res Soc 69(5):691\u2013706","journal-title":"J Op Res Soc"},{"issue":"2","key":"633_CR44","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.ejor.2018.06.049","volume":"272","author":"M Reihaneh","year":"2019","unstructured":"Reihaneh M, Ghoniem A (2019) A branch-and-price algorithm for a vehicle routing with demand allocation problem. Eur J Op Res 272(2):523\u2013538","journal-title":"Eur J Op Res"},{"key":"633_CR45","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 M, Toriello A (2017) Vehicle routing with roaming delivery locations. Transp Res Part C: Emerg Technol 80:71\u201391","journal-title":"Transp Res Part C: Emerg Technol"},{"issue":"3","key":"633_CR46","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Dis Optim 3(3):255\u2013273","journal-title":"Dis Optim"},{"key":"633_CR47","unstructured":"Sampaio Oliveira A, Kinable J, Veelenturf L, van Woensel T (2019) A scenario-based approach for the vehicle routing problem with roaming delivery locations under stochastic travel times. Workingpaper, Optimization Online"},{"issue":"2","key":"633_CR48","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/trsc.2016.0675","volume":"50","author":"M Savelsbergh","year":"2016","unstructured":"Savelsbergh M, Van Woensel T (2016) 50th anniversary invited article\u2013city logistics: challenges and opportunities. Transp Sci 50(2):579\u2013590","journal-title":"Transp Sci"},{"issue":"3","key":"633_CR49","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.ejor.2020.02.033","volume":"285","author":"S Schwerdfeger","year":"2020","unstructured":"Schwerdfeger S, Boysen N (2020) Optimizing the changing locations of mobile parcel lockers in last-mile distribution. Eur J Op Res 285(3):1077\u20131094","journal-title":"Eur J Op Res"},{"issue":"1\u20132","key":"633_CR50","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. Annal Op Res 273(1\u20132):257\u2013277","journal-title":"Annal Op Res"},{"issue":"2","key":"633_CR51","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2017.03.017","volume":"261","author":"C Tilk","year":"2017","unstructured":"Tilk C, Rothenb\u00e4cher A-K, Gschwind T, Irnich S (2017) Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur J Op Res 261(2):530\u2013539","journal-title":"Eur J Op Res"},{"key":"633_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/547485","volume":"2014","author":"X Wang","year":"2014","unstructured":"Wang X, Zhan L, Ruan J, Zhang J (2014) How to choose last mile delivery modes for e-fulfillment. Math Probl Eng 2014:1\u201311","journal-title":"Math Probl Eng"},{"key":"633_CR53","doi-asserted-by":"crossref","unstructured":"Zhang SZ, Lee C KM (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 (IEEM). IEEE","DOI":"10.1109\/IEEM.2016.7798211"},{"issue":"2","key":"633_CR54","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 Op Res 265(2):765\u2013778","journal-title":"Eur J Op Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00633-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00633-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00633-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T05:10:47Z","timestamp":1675487447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00633-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["633"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00633-0","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"14 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}