Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods

Abstract In this paper, we present a review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW). Over the past 20 years vehicle routing problem with time windows has been an area of research that has attracted many researchers. In this period a number of papers have been published on the exact, heuristics and metaheursitics methods of the routing problem with time windows. This problem has model character in many branches of mathematics, computer science, and operations research. Metaheuristics support managers in decision-making with robust that provide high-quality solutions to important applications in business, engineering, economic and science in reasonable time horizons.

[1]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[4]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

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

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

[7]  M. Pirlot.  General local search methods , 1996 .

[8]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[9]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

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

[11]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[12]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[15]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[16]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[17]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

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

[19]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[20]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[21]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[22]  H. Van Landeghem,et al.  A bi-criteria heuristic for the vehicle routing problem with time windows , 1988 .

[23]  Chung-Lun Li,et al.  Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems , 1990, INFORMS J. Comput..

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

[25]  Jacques Teghem,et al.  A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing , 2004, Metaheuristics for Multiobjective Optimisation.

[26]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[27]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[28]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[29]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[30]  Jürgen Schulze,et al.  A parallel algorithm for the vehicle routing problem with time window constraints , 1999, Ann. Oper. Res..

[31]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

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

[33]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[34]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[35]  Jacques Teghem,et al.  Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search , 1994, Ann. Oper. Res..

[36]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..