A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem |
| |
| Authors: | A.D. Ló pez-Sá nchez,A.G. Herná ndez-Dí az,D. Vigo,R. Caballero,J. Molina |
| |
| Affiliation: | 1. Pablo de Olavide University, Ctra. Utrera, Km 1, 41013 Seville, Spain;2. Alma Mater, University of Bologna, DEI “Guglielmo Marconi”, Viale Risorgimento, 2, 40136 Bologna, Italy;3. University of Málaga, Campus El Ejido s/n, 29071 Málaga, Spain |
| |
| 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. |
| |
| Keywords: | Open Vehicle Routing Problem Multi-start algorithm Local search algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
