Bernal Moyano JB, Escobar JW, Linfati R (2021)
Publication Type: Journal article
Publication year: 2021
Original Authors: Jose Bernal, John Willmer Escobar, Rodrigo Linfati
Book Volume: 13
Pages Range: 185-204
Article Number: 112923
Issue: 1/2
Journal Issue: 1-2
DOI: 10.1504/IJSTL.2021.112923
We propose a meta-heuristic algorithm for addressing a real case of vehicle routing problem with a heterogeneous fleet and time windows. Our proposal consists of generating an initial feasible solution using the solution of a travelling salesman problem and, subsequently, refining it through simulated annealing. In this work, we evaluate the suitability of our development to planning the distribution of a regional distribution centre of a food company to customers within the urban perimeter of Cali, Colombia. Following the company's customer satisfaction goals, our primary aim is to route to reach a service level of 95% while reducing operational costs. Our results on our real case study show that our meta-heuristic algorithm finds better routes than current ones, in terms of costs and service levels, in a relatively short time.
APA:
Bernal Moyano, J.B., Escobar, J.W., & Linfati, R. (2021). A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows. International Journal of Shipping and Transport Logistics, 13(1-2), 185-204. https://doi.org/10.1504/IJSTL.2021.112923
MLA:
Bernal Moyano, Jose Bernal, John Willmer Escobar, and Rodrigo Linfati. "A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows." International Journal of Shipping and Transport Logistics 13.1-2 (2021): 185-204.
BibTeX: Download