A two-phase hybrid metaheuristic for the vehicle routing problem with time windows

Abstract The subject of this paper is a two-phase hybrid metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The objective function of the VRPTW considered here combines the minimization of the number of vehicles (primary criterion) and the total travel distance (secondary criterion). The aim of the first phase is the minimization of the number of vehicles by means of a ( μ , λ )-evolution strategy, whereas in the second phase the total distance is minimized using a tabu search algorithm. The two-phase hybrid metaheuristic was subjected to a comparative test on the basis of 356 problems from the literature with sizes varying from 100 to 1000 customers. The derived results show that the proposed two-phase approach is very competitive.

[1]  Fuh-Hwa Franklin Liu,et al.  Theory and Methodology A route-neighborhood-based metaheuristic for vehicle routing problem with time windows , 1999 .

[2]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

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

[4]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

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

[6]  Paul Ablay,et al.  Optimieren mit Evolutionsstrategien: Reihenfolgeprobleme, nichtlineare und ganzzahlige Optimierung , 1979 .

[7]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[8]  M. Gietz.  Computergestützte Tourenplanung mit zeitkritischen Restriktionen , 1994 .

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

[10]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[11]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[12]  James P. Kelly,et al.  Meta-Heuristics: An Overview , 1996 .

[13]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

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

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

[16]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[18]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[19]  Kendall E. Nygard,et al.  GIDEON: a genetic algorithm system for vehicle routing with time windows , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.

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

[21]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[22]  Noor Hasnah Moin.  Hybrid Genetic Algorithms for Vehicle Routing Problems with Time Windows , 2002 .

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

[24]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[25]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

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

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

[28]  Parallel Problem Solving from Nature, 1st Workshop, PPSN I, Dortmund, Germany, October 1-3, 1990, Proceedings , 1991, PPSN.

[29]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .

[30]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

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

[32]  Fuh-Hwa Franklin Liu,et al.  A route-neighborhood-based metaheuristic for vehicle routing problem with time windows , 1999, Eur. J. Oper. Res..

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

[34]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[35]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[36]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

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

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

[39]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[40]  Thomas Bäck,et al.  Genetic Algorithms and Evolution Strategies - Similarities and Differences , 1990, PPSN.

[41]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .