A Fast Look-ahead Heuristic for the Multi-depot Vehicle Routing Problem

The multi-depot vehicle routing problem (MDVRP) is a very challenging part of supply chain optimization. We propose here a simple yet powerful heuristic for the MDVRP with an integrated look-ahead. Compared to other state-of-the-art approaches, our heuristic is significantly faster, but yields competitive results and even found several new best solutions on a set of standard benchmark problems.

[1]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

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

[3]  Heinz-Konrad Weuthen.  Tourenplanung-Lösungsverfahren für Mehrdepot-Probleme , 1983 .

[4]  Saïd Salhi,et al.  Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem , 2001 .

[5]  R. Lathe.  Phd by thesis , 1988, Nature.

[6]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[7]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[8]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[9]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[10]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[11]  Stephan Scheuerer.  Neue Tabusuche-Heuristiken für die logistische Tourenplanung bei restringierendem Anhängereinsatz, mehreren Depots und Planungsperioden , 2004 .

[12]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[13]  F. A. Tillman,et al.  A study of a look-ahead procedure for solving the multiterminal delivery problem , 1971 .

[14]  Prakash Bhatt.  A graph-theoretic approach to delivery problems , 1972 .

[15]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[16]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[17]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[18]  Fritz Matthaus.  Tourenplanung : Verfahren zur Einsatzdisposition von Fuhrparks , 1978 .

[19]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.