Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897253 | European Journal of Operational Research | 2014 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A.D. López-Sánchez, A.G. Hernández-DÃaz, D. Vigo, R. Caballero, J. Molina,