{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T18:09:48Z","timestamp":1792519788329,"version":"4.5.0"},"reference-count":25,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T00:00:00Z","timestamp":1599091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We consider the problem of utilizing the parcel locker network for the logistics solution in the metropolitan area. Two-echelon distribution systems are attractive from an economic standpoint, whereas the product from the depot can be distributed from or to intermediate facilities. In this case, the intermediate facilities are considered as locker facilities present in an accessible location in the vicinity of the final customers. In addition, the utilization of locker facilities can reduce the cost caused by the unattended deliveries. The problem is addressed as an optimization model that formulated into an integer linear programming model denoted as the two-echelon vehicle routing problem with locker facilities (2EVRP-LF). The objective is to minimize the cost of transportation with regards to the vehicle travelling cost, the intermediate facilities renting cost, and the additional cost to compensate the customer that needs to travel to access the intermediate facilities. Because of its complexity, a simulated annealing algorithm is proposed to solve the problem. On the other hand, the modelling approach can be conducted by generating two-phase optimization model approaches, which are the p-median problem and the capacitated vehicle routing problem. The results from both methods are compared in numerical experiments. The results show the effectiveness of 2EVRP-LF compared to the two-phase optimization. Furthermore, the simulated annealing algorithm showed an effective performance in solving 2EVRP-LF.<\/jats:p>","DOI":"10.3390\/a13090218","type":"journal-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T08:40:26Z","timestamp":1599122426000},"page":"218","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3520-5260","authenticated-orcid":false,"given":"A. A. N. Perwira","family":"Redi","sequence":"first","affiliation":[{"name":"Industrial Engineering Department, BINUS Graduate Program\u2014Master of Industrial Engineering, Bina Nusantara University, Jakarta 11480, Indonesia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parida","family":"Jewpanya","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Rajamangala University of Technology Lanna Tak, Tak 63000, Thailand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adji Candra","family":"Kurniawan","sequence":"additional","affiliation":[{"name":"Department of Logistics Engineering, Universitas Pertamina, Jakarta 12220, Indonesia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satria Fadil","family":"Persada","sequence":"additional","affiliation":[{"name":"Department of Business Management, Institut Teknologi Sepuluh Nopember, Surabaya 60111, Indonesia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reny","family":"Nadlifatin","sequence":"additional","affiliation":[{"name":"Department of Technology Management, Institut Teknologi Sepuluh Nopember, Surabaya 60111, Indonesia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oki Anita Candra","family":"Dewi","sequence":"additional","affiliation":[{"name":"Logistics Engineering Department, Universitas Internasional Semen Indonesia, Gresik 61122, Indonesia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,9,3]]},"reference":[{"key":"ref_1","unstructured":"(2019, October 03). Statista Global Retail E-Commerce Market Size 2014\u20142021. Available online: https:\/\/www.statista.com\/statistics\/379046\/worldwide-retail-e-commerce-sales\/."},{"key":"ref_2","unstructured":"Gevaers, R., Van de Voorde, E., and Vanelslander, T. (2009). Characteristics of Innovations in Last-Mile Logistics-Using Best Practices, Case Studies and Making the Link with Green and Sustainable Logistics, Association for European Transport and Contributors."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1108\/09600030110399414","article-title":"The reception box impact on home delivery efficiency in the e-grocery business","volume":"31","author":"Saranen","year":"2001","journal-title":"Int. J. Phys. Distrib. Logist. Manag."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.trpro.2016.11.027","article-title":"Usability of the parcel lockers from the customer perspective\u2013the research in Polish Cities","volume":"16","author":"Lemke","year":"2016","journal-title":"Transp. Res. Procedia"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","article-title":"The two-echelon capacitated vehicle routing problem: Models and math-based heuristics","volume":"45","author":"Perboli","year":"2011","journal-title":"Transp. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.cor.2014.06.008","article-title":"A survey on two-echelon routing problems","volume":"55","author":"Cuda","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","article-title":"A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem","volume":"47","author":"Jepsen","year":"2013","journal-title":"Transp. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1007\/s11590-012-0568-3","article-title":"Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem","volume":"7","author":"Santos","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/opre.1120.1153","article-title":"An exact algorithm for the two-echelon capacitated vehicle routing problem","volume":"61","author":"Baldacci","year":"2013","journal-title":"Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sitek, P. (2014). A hybrid approach to the two-echelon capacitated vehicle routing problem (2E-CVRP). Recent Advances in Automation, Robotics and Measuring Techniques, Springer.","DOI":"10.1007\/978-3-319-05353-0_25"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.ijpe.2014.11.016","article-title":"The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations","volume":"164","author":"Soysal","year":"2015","journal-title":"Int. J. Prod. Econ."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1287\/trsc.2013.0500","article-title":"A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem","volume":"49","author":"Santos","year":"2015","journal-title":"Transp. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.cor.2016.06.014","article-title":"A large neighbourhood based heuristic for two-echelon routing problems","volume":"76","author":"Breunig","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.trd.2016.10.002","article-title":"The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems considering carbon dioxide emissions","volume":"49","author":"Li","year":"2016","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Eitzen, H., Lopez-Pires, F., Baran, B., Sandoya, F., and Chicaiza, J.L. (2017, January 4\u20138). A Multi-Objective Two-Echelon Vehicle Routing Problem. An Urban Goods Movement Approach for Smart City Logistics. Proceedings of the 2017 XLIII Latin American Computer Conference (CLEI), Cordoba, Argentina.","DOI":"10.1109\/CLEI.2017.8226454"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.trd.2017.09.018","article-title":"Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service","volume":"57","author":"Wang","year":"2017","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1057\/s41274-016-0170-7","article-title":"A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service","volume":"68","author":"Wang","year":"2017","journal-title":"J. Oper. Res. Soc."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ejor.2017.10.017","article-title":"A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints","volume":"266","author":"Liu","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","first-page":"62","article-title":"A multi-objective two-echelon capacitated vehicle routing problem for perishable products","volume":"11","author":"Sahraeian","year":"2018","journal-title":"J. Ind. Syst. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"107598","DOI":"10.1016\/j.ijpe.2019.107598","article-title":"Two echelon vehicle routing problem with drones in last mile delivery","volume":"225","author":"Kitjacharoenchai","year":"2020","journal-title":"Int. J. Prod. Econ."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/00207543.2017.1395490","article-title":"A parcel locker network as a solution to the logistics last mile problem","volume":"56","author":"Deutsch","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","article-title":"A simulated annealing heuristic for the hybrid vehicle routing problem","volume":"53","author":"Yu","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1080\/0305215X.2018.1437153","article-title":"Simulated annealing heuristic for the general share-a-ride problem","volume":"50","author":"Yu","year":"2018","journal-title":"Eng. Optim."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.30656\/jsmi.v4i1.2215","article-title":"Simulated annealing algorithm for solving the capacitated vehicle routing problem: A case study of pharmaceutical distribution","volume":"4","author":"Redi","year":"2020","journal-title":"J. Sist. Dan Manaj. Ind."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/9\/218\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:06:17Z","timestamp":1760177177000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/9\/218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,3]]},"references-count":25,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2020,9]]}},"alternative-id":["a13090218"],"URL":"https:\/\/doi.org\/10.3390\/a13090218","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,3]]}}}