Memetic and Genetic Algorithms: A Comparison among Different Approaches to Solve Vehicle Routing Problem with Time Windows

This paper presents four different kinds of Evolutionary Algorithms (EA), for the Vehicle Routing Problem with Time Windows. A comparison among four EAs was made in order to investigate approaches such as genetic memory of populations, which avoids the loss of good genetic threads during search process and the hybridization of the EAs through local search, forming Memetic Algorithms.

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

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

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

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

[5]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[6]  Melanie Mitchell,et al.  L.D. Davis, Handbook of Genetic Algorithms* , 1998 .

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

[8]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

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

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

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

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

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

[14]  Geraldo Robson Mateus,et al.  A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows , 2004, Fourth International Conference on Hybrid Intelligent Systems (HIS'04).

[15]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[16]  Humberto Cesar Brandao de Oliveira,et al.  Reducing Traveled Distance in the Vehicle Routing Problem with Time Windows using a Multi-Start Simulated Annealing , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.