Next Article in Journal
Relaxed Rule-Based Learning for Automated Predictive Maintenance: Proof of Concept
Previous Article in Journal
R2D2: A Dbpedia Chatbot Using Triple-Pattern Like Queries
Article

A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities

1
Industrial Engineering Department, BINUS Graduate Program—Master of Industrial Engineering, Bina Nusantara University, Jakarta 11480, Indonesia
2
Department of Industrial Engineering, Rajamangala University of Technology Lanna Tak, Tak 63000, Thailand
3
Department of Logistics Engineering, Universitas Pertamina, Jakarta 12220, Indonesia
4
Department of Business Management, Institut Teknologi Sepuluh Nopember, Surabaya 60111, Indonesia
5
Department of Technology Management, Institut Teknologi Sepuluh Nopember, Surabaya 60111, Indonesia
6
Logistics Engineering Department, Universitas Internasional Semen Indonesia, Gresik 61122, Indonesia
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(9), 218; https://doi.org/10.3390/a13090218
Received: 6 August 2020 / Revised: 1 September 2020 / Accepted: 1 September 2020 / Published: 3 September 2020
(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
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. View Full-Text
Keywords: vehicle routing problem; locker facilities; integer linear programming vehicle routing problem; locker facilities; integer linear programming
Show Figures

Figure 1

MDPI and ACS Style

Redi, A.A.N.P.; Jewpanya, P.; Kurniawan, A.C.; Persada, S.F.; Nadlifatin, R.; Dewi, O.A.C. A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities. Algorithms 2020, 13, 218. https://doi.org/10.3390/a13090218

AMA Style

Redi AANP, Jewpanya P, Kurniawan AC, Persada SF, Nadlifatin R, Dewi OAC. A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities. Algorithms. 2020; 13(9):218. https://doi.org/10.3390/a13090218

Chicago/Turabian Style

Redi, A. A.N.P.; Jewpanya, Parida; Kurniawan, Adji C.; Persada, Satria F.; Nadlifatin, Reny; Dewi, Oki A.C. 2020. "A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities" Algorithms 13, no. 9: 218. https://doi.org/10.3390/a13090218

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop