A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows

A parallel memetic algorithm for the NP-hard vehicle routing problem with time windows (VRPTW) is proposed. The algorithm consists of components which are executed as parallel processes. A process runs either a heuristic algorithm or a hybrid of a genetic algorithm and some local refinement procedures. In order to improve the results, processes co-operate periodically using a novel randomized scheme. During each phase of co-operation processes exploit their best solutions found so far. The purpose of the work is to devise the parallel memetic algorithm which determines the VRPTW solutions of the highest possible quality. The experiments on Gehring and Homberger's (GH) benchmarking tests show that the algorithm achieves very good results. By making use of it the best-known solutions to 171 out of 300 GH tests were improved.

[1]  Jakub Nalepa,et al.  A parallel heuristic algorithm to solve the vehicle routing problem with time windows , 2012 .

[2]  Yuichi Nagata,et al.  Edge Assembly Crossover for the Capacitated Vehicle Routing Problem , 2007, EvoCOP.

[3]  Wout Dullaert,et al.  A multi-start local search algorithm for the vehicle routing problem with time windows , 2004, Eur. J. Oper. Res..

[4]  Nacima Labadie,et al.  A memetic algorithm for the vehicle routing problem with time windows , 2008, RAIRO Oper. Res..

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

[6]  Teodor Gabriel Crainic,et al.  Parallel Metaheuristics Applications , 2005 .

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

[8]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

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

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

[11]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[13]  Zbigniew J. Czech,et al.  A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows , 2012, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems.

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

[15]  Mohamed Barkaoui,et al.  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows , 2004, Comput. Oper. Res..

[16]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[17]  Yuichi Nagata,et al.  A powerful route minimization heuristic for the vehicle routing problem with time windows , 2009, Oper. Res. Lett..

[18]  Zbigniew J. Czech,et al.  A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows , 2011, PPAM.

[19]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.