A savings based method for real-life vehicle routing problems

This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a sequential insertion algorithm on real-life data. Besides the traditional quality measures such as total distance travelled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the ‘visual attractiveness’ of the plan. Computational results show that, in general, the savings based algorithm not only performs better with respect to these non-standard quality measures, but also with respect to the traditional measures.

[1]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[2]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[3]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[4]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[5]  Martin Desrochers,et al.  A new heuristic for the fleet size and mix vehicle routing problem , 1991, Comput. Oper. Res..

[6]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[7]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

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

[9]  Peter G. Eibl.  Computerised vehicle routing and scheduling in road transport , 1996 .

[10]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[11]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[12]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[13]  Bruce L. Golden,et al.  A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem , 1999 .

[14]  Frédéric Semet,et al.  A two-phase algorithm for the partial accessibility constrained vehicle routing problem , 1995, Ann. Oper. Res..

[15]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .