A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

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.

[1]  Christos D. Tarantilis,et al.  Combination of geographical information system and efficient routing algorithms for real life distribution operations , 2004, Eur. J. Oper. Res..

[2]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[3]  Panagiotis P. Repoussis,et al.  A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..

[4]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[5]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[6]  Adam N. Letchford,et al.  A branch-and-cut algorithm for the capacitated open vehicle routing problem , 2007, J. Oper. Res. Soc..

[7]  Emmanouil E. Zachariadis,et al.  An open vehicle routing problem metaheuristic for examining wide solution neighborhoods , 2010, Comput. Oper. Res..

[8]  Joaquín A. Pacheco Bonrostro,et al.  Minmax Vehicle Routing Problems: Application to School Transport in the Province of Burgos , 2001 .

[9]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

[10]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[11]  Gilbert Laporte,et al.  An adaptive memory heuristic for a class of vehicle routing problems with minmax objective , 1997, Comput. Oper. Res..

[12]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[13]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[14]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[15]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

[16]  J. M. Moreno-Vega,et al.  Advanced Multi-start Methods , 2010 .

[17]  O. J. Dunn.  Multiple Comparisons Using Rank Sums , 1964 .

[18]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..