The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances.
A.D. López-Sánchez, A.G. Hernández-Díaz, D. Vigo, R. Caballero, J. Molina (2014). A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 238, 104-113 [10.1016/j.ejor.2014.04.008].
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem
VIGO, DANIELE;
2014
Abstract
The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
