A parallel hybrid genetic algorithm for the vehicle routing problem with time windows

Abstract A parallel version of a new hybrid genetic algorithm for the vehicle routing problem with time windows is presented. The route-directed hybrid genetic approach is based upon the simultaneous evolution of two populations of solutions focusing on separate objectives subject to temporal constraint relaxation. While the first population evolves individuals to minimize total traveled distance the second aims at minimizing temporal constraint violation to generate a feasible solution. Genetic operators have been designed to capture key concepts from successful routing techniques to further enhance search diversification and intensification. A master–slave message-passing paradigm characterizes the parallel procedure. The master component controls the execution of the algorithm, coordinates genetic operations and handles parent selection while the slave elements concurrently execute reproduction and mutation operators. Providing additional speed-up, the parallel algorithm further expands on its sequential counterpart, matching or even improving solution quality. Computational results show the proposed technique to be very competitive with the best-known heuristic routing procedures providing some new best-known solutions.

[1]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

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

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

[4]  Jörg Homberger,et al.  Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows , 2002, J. Heuristics.

[5]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

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

[7]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[8]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[9]  Loo Hay Lee,et al.  Hybrid Genetic Algorithm in Solving Vehicle Routing Problems with Time Window Constraints (APORS) , 2000 .

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

[11]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[12]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[13]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

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

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

[16]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

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

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

[19]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[20]  Sam R. Thangiah,et al.  Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .

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

[22]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .

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

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

[25]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows and Itinerary Constraints , 1999, GECCO.

[26]  Anil Kumar Lawania.  Algorithms For The Vehicle Routing Problems , 1992 .

[27]  Larry J. Eshelman,et al.  Proceedings of the 6th International Conference on Genetic Algorithms , 1995 .

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

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

[30]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

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

[32]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

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

[35]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows , 1998, Canadian Conference on AI.

[36]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[37]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

[39]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

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

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

[42]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[43]  Sam R. Thangiah,et al.  An Adaptive Clustering Method Using a Geometric Shape for Vehicle Routing Problems with Time Windows , 1995, ICGA.