A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem

The aim of this study is to describe a new stochastic search meta-heuristic algorithm for solving the Capacitated Vehicle Routing Problem (CVRP), termed as the List Based Threshold Accepting (LBTA) algorithm. The main advantage of this algorithm over the majority of other meta-heuristics is that it produces quite satisfactory solutions in reasonable amount of time by tuning only one parameter of the algorithm. This property makes this algorithm a reliable and a practical tool for every decision support system designed for solving real life vehicle routing problems.

[1]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[2]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[3]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[4]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[5]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[6]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[7]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[8]  C. D. J. Waters A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement , 1987 .

[9]  V. Vassiliadis,et al.  A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem , 2002 .

[10]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[11]  Said Salhi,et al.  Improvements to Vehicle Routeing Heuristics , 1987 .

[12]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[13]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[14]  Timothy T. Duncan Experiments in the use of Neighbourhood Search techniques for Vehicle Routing , 1995 .

[15]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[16]  Gülay Barbarosoglu,et al.  A tabu search algorithm for the vehicle routing problem , 1999, Comput. Oper. Res..

[17]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[18]  Barrie M. Baker,et al.  Extensions to the generalised assignment heuristic for vehicle routing , 1999, Eur. J. Oper. Res..

[19]  James P. Kelly,et al.  A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem , 1999, INFORMS J. Comput..

[20]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[21]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .