A genetic algorithm to solve the vehicle routing problem with full loads and time windows constraints

The purpose of this paper is the use of the structure of a genetic algorithm (GA) to solve a variant of the vehicle routing problem with time windows (VRPTW), which builds an initial population in order to solve the problem of assigning the vehicles routes and to arrange the vehicles which satisfy the demand in sequence. Then a simple GA is runned to develop a global exploration in the entire population of found solutions. Using this, we can minimize the number of vehicles per day and reduce the waiting time for a further reallocation of trips. A computational comparison shows the e! ciency of the proposed GA for the problem under study resolved in CPLEX 8.1 with relaxed restrictions.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  Kenneth Sörensen,et al.  Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows , 2010, Comput. Oper. Res..

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

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

[5]  J. Pet-Edwards,et al.  Application of genetic algorithms in resource constrained network optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[6]  Heung-Suk Hwang,et al.  An improved model for vehicle routing problem with time constraint based on genetic algorithm , 2002 .

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

[8]  Hoda A. ElMaraghy,et al.  Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms , 2000 .

[9]  Abel García-Nájera,et al.  An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows , 2011, Comput. Oper. Res..

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

[11]  Jean-Yves Potvin,et al.  Evolutionary Algorithms for Vehicle Routing , 2007 .

[12]  Yang-Byung Park,et al.  A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines , 2001 .

[13]  Nicolas Jozefowiez,et al.  An evolutionary algorithm for the vehicle routing problem with route balancing , 2009, Eur. J. Oper. Res..

[14]  Jean-Yves Potvin,et al.  A hybrid approach to vehicle routing using neural networks and genetic algorithms , 1996, Applied Intelligence.

[15]  Dalessandro Soares Vianna,et al.  A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet , 1998, Future Gener. Comput. Syst..

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

[17]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[18]  Lawrence Bodin,et al.  Twenty Years of Routing and Scheduling , 1990, Oper. Res..

[19]  Jean Berger,et al.  A new hybrid genetic algorithm for the capacitated vehicle routing problem , 2003, J. Oper. Res. Soc..