A Multi-Start Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows

Vehicle Routing Problems have been analyzed to reduce transportation costs of people and goods. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a very common characteristic in real world picking up and delivery problems. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient hybrid system which associates a nonmonotonic Simulated Annealing technique to a Hill Climbing Strategy with Random Restart (Multi-Start). The algorithm performance is evaluated by comparing the results achieved with the best published works found in the literature of the 56 Solomon instances. The results outperformed or paired the individual best previous results in 36 out of the 56 instances.

[1]  Michel Gendreau,et al.  Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows , 2001 .

[2]  A. E. Eiben,et al.  Authors' Answer to the Book Review of Introduction to Evolutionary Computing Published in Issue 12:2 , 2004, Evolutionary Computation.

[3]  Louis Kriesberg.  Coal and Conflict: A Study of Industrial Relations at Collieries.W. H. Scott , Enid Mumford , L. C. McGivering , J. M. Kirkby , 1964 .

[4]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[5]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

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

[7]  Guilherme Bastos Alvarenga.  Um algoritmo híbrido para os problemas de roteamento de veículos estático e dinâmico com janela de tempo , 2005 .

[8]  Jesper Larsen,et al.  Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .

[9]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[10]  Michel Gendreau,et al.  METAHEURISTICS FOR THE VEHICLE ROUTING PROBLEM. , 1994 .

[11]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

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

[13]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Gerhart F King,et al.  EXCESS TRAVEL: CAUSES, EXTENT, AND CONSEQUENCES , 1987 .

[16]  Michel Gendreau,et al.  Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[17]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[18]  Patrick Prosser,et al.  Guided Local Search for the Vehicle Routing Problem , 1997 .

[19]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[20]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[21]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[22]  V. Furnon.  Meta-heuristics in Constraint ProgrammingExperiments with Tabu Search on the Vehicle RoutingProblemBruno , 2007 .