Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

AbstractThe vehicle routing problem with time windows (VRPTW) is an extension of the well-known vehicle routing problem with a central depot. The objective is to design an optimal set of routes that services all customers and satisfies the given constraints, especially the time window constraints. The objective function considered here combines the minimization of the number of vehicles (primary criterion) and the total travel distance minimization (secondary criterion). In this paper, two evolution strategies for solving the VRPTW are proposed. The evolution strategies were tested on 58 problems from the literature with sizes varying from 100 to 417 customers and 2 to 54 vehicles. The generated new best known solutions indicate that evolution strategies are effective in reducing both the number of vehicles and the total travel distance

[1]  M M Solomon,et al.  VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

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

[3]  P. Husbands.  Evolving artificial intelligence , 2001, Trends in Cognitive Sciences.

[4]  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.

[5]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[6]  H. Gehring,et al.  Zwei genetische Algorithmen zur Lösung des Bandabgleichproblems , 1994 .

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

[8]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

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

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

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

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

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

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

[15]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

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

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

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

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

[21]  Wolfgang Domschke,et al.  Logistik: Rundreisen und Touren , 1997 .

[22]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .

[23]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

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