{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T04:15:33Z","timestamp":1772597733202,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:00:00Z","timestamp":1643241600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:00:00Z","timestamp":1643241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00500-021-06592-6","type":"journal-article","created":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:03:17Z","timestamp":1643241797000},"page":"12843-12861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Last mile deliveries with lockers: formulations and algorithms"],"prefix":"10.1007","volume":"27","author":[{"given":"Giovanni","family":"Buzzega","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8600-8000","authenticated-orcid":false,"given":"Stefano","family":"Novellani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,27]]},"reference":[{"key":"6592_CR1","unstructured":"Amazon (2020) Amazon hub. https:\/\/www.amazon.it\/b?node=16679461031"},{"issue":"5","key":"6592_CR2","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci R, Hadjiconstantinou E, Mingozzi A (2004) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52(5):723\u2013738","journal-title":"Oper Res"},{"issue":"4","key":"6592_CR3","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"issue":"2","key":"6592_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas Y, Desrosiers J, Gelinas E, Solomon MM (1995) An optimal algorithm for the traveling salesman problem with time windows. Oper Res 43(2):367\u2013371","journal-title":"Oper Res"},{"key":"6592_CR5","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 (2021) A large neighborhood search approach to the vehicle routing problem with delivery options. Transp Res Part B: Methodol 144:103\u2013132","journal-title":"Transp Res Part B: Methodol"},{"key":"6592_CR6","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 MA, 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","journal-title":"Comput & Oper Res"},{"issue":"3","key":"6592_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"46","author":"M Gendreau","year":"1998","unstructured":"Gendreau M, Hertz A, Laporte G, Stan M (1998) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper Res 46(3):330\u2013335","journal-title":"Oper Res"},{"key":"6592_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-020-00725-2","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 Oper Res. https:\/\/doi.org\/10.1007\/s10100-020-00725-2","journal-title":"Cent Eur J Oper Res"},{"issue":"16","key":"6592_CR9","doi-asserted-by":"publisher","first-page":"5077","DOI":"10.1080\/00207543.2019.1656842","volume":"58","author":"L Jiang","year":"2020","unstructured":"Jiang L, Dhiaf M, Dong J, Liang C, Zhao S (2020) A traveling salesman problem with time windows for the last mile delivery in online shopping. Int J Prod Res 58(16):5077\u20135088","journal-title":"Int J Prod Res"},{"key":"6592_CR10","doi-asserted-by":"publisher","unstructured":"Mancini S, Gansterer M (2020) Vrp with private and shared delivery locations (instances). Mendeley Data V1. https:\/\/doi.org\/10.17632\/wwmvnkm46h.1","DOI":"10.17632\/wwmvnkm46h.1"},{"key":"6592_CR11","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":"6592_CR12","doi-asserted-by":"crossref","unstructured":"Mitrea IA, Zenezini G, De\u00a0Marco A, Ottaviani FM, Delmastro T, Botta C (2020) Estimating e-consumers\u2019 attitude towards parcel locker usage. In: 2020 IEEE 44th annual computers, software, and applications conference (COMPSAC), IEEE, pp 1731\u20131736","DOI":"10.1109\/COMPSAC48688.2020.000-5"},{"key":"6592_CR13","doi-asserted-by":"publisher","unstructured":"Oliveira WJP, dos Santos AG (2020) Last mile delivery with lockers: formulation and heuristic. In: Proceedings of the 22nd international conference on enterprise information systems (ICEIS 2020), Vol 1, Science and Technology Publications, pp. 460\u2013467. https:\/\/doi.org\/10.5220\/0009580004600467","DOI":"10.5220\/0009580004600467"},{"issue":"5","key":"6592_CR14","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":"6592_CR15","doi-asserted-by":"crossref","unstructured":"Osaba E, Del\u00a0Ser J, Nebro AJ, La\u00f1a I, Bilbao MN, Sanchez-Medina JJ (2018) Multi-objective optimization of bike routes for last-mile package delivery with drop-offs. In: 2018 21st international conference on intelligent transportation systems (ITSC), IEEE, pp. 865\u2013870","DOI":"10.1109\/ITSC.2018.8569273"},{"key":"6592_CR16","unstructured":"Rohmer S, Gendron B (2020) A guide to parcel lockers in last mile distribution\u2014highlighting challenges and opportunities from an or perspective. CIRRELT"},{"issue":"1\u20132","key":"6592_CR17","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\u20132):257\u2013277","journal-title":"Ann Oper Res"},{"key":"6592_CR18","unstructured":"Statista (2020) Retail e-commerce sales worldwide from 2014 to 2021 (in billion u.s. dollars), https:\/\/www.statista.com\/statistics\/379046\/worldwide-retail-e-commerce-sales\/. (Accessed: 2021-09-10)"},{"key":"6592_CR19","doi-asserted-by":"publisher","unstructured":"Tilk C, Olkis K, Irnich S (2021) The last-mile vehicle routing problem with delivery options. OR Spect 43:877\u2013904. https:\/\/doi.org\/10.1007\/s00291-021-00633-0","DOI":"10.1007\/s00291-021-00633-0"},{"key":"6592_CR20","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9780898718515"},{"key":"6592_CR21","doi-asserted-by":"crossref","unstructured":"Wen J, Li Y (2016) Vehicle routing optimization of urban distribution with self-pick-up lockers. In: 2016 international conference on logistics. informatics and service sciences (LISS), IEEE, pp. 1\u20136","DOI":"10.1109\/LISS.2016.7854384"},{"key":"6592_CR22","doi-asserted-by":"crossref","unstructured":"Zhou F, He Y, Zhou L (2019) Last mile delivery with stochastic travel times considering dual services. IEEE Access 7:159013\u2013159021","DOI":"10.1109\/ACCESS.2019.2950442"},{"issue":"2","key":"6592_CR23","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","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06592-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06592-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06592-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T13:18:43Z","timestamp":1690377523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06592-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,27]]},"references-count":23,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["6592"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06592-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,27]]},"assertion":[{"value":"17 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"the authors declare that have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}