A memetic algorithm for the vehicle routing problem with time windows

RAIRO - Operations Research

Volumn 42, Issue 3, 2008, Pages 415-431

  Labadi, Nacima ^b   Prins, Christian ^b   Reghioui, Mohamed ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b NONE

Author keywords

Memetic algorithm; Time window; Vehicle routing problem

Indexed keywords

GENETIC ALGORITHMS; ROUTING ALGORITHMS; VEHICLES;

MEMETIC ALGORITHMS; META HEURISTICS; NUMBER OF VEHICLES; SOLUTION METHODS; TIME WINDOWS; TOTAL DISTANCES; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 49749083973     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2008021     Document Type: Article

References (28)

1. G.B. Alvarenga, G.R. Mateus and G. de Tomi, A genetic and set partitioning two-phase approch for the vehicle routing problem with time windows. Comput. Oper. Res. 34 (2007) 1561-1584.
2. J. Berger, M. Barkaoui and O. Bräysy, A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Inf. Syst. Oper. Res. 41 (2003) 179-194.
3. J. Berger, M. Salois and R. Begin, A hybrid genetic algorithm, for the vehicle routing problem with time windows. Lecture Notes in Artificial Intelligence 1418. Springer, Berlin. (1998) 114-127.
4. J.L. Blanton and R.L. Wainwright, Multiple vehicle routing with time and capacity constraints using genetic algorithms, Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, San. Francisco (1993) 452-459.
5. O. Bräysy, W. Dullaert and M. Gendreau, Evolutionary algorithms for the vehicle routing problem with time windows. J. Heuristics 10 (2005) 587-611.
6. O. Bräysy and M. Gendreau, Vehicle routing problem with time windows - Part I: route construction and local search algorithms. Transportation Science 39 (2005) 104-118.
7. O. Bräysy and M. Gendreau, Vehicle routing problem with time windows - Part II: metaheuristics. Transportation Science 39 (2005) 119-139.
8. G. Clarke and J.W. Wright, Scheduling of vehicles from, a central depot to a number of delivery points. Oper. Res. 12 (1964) 568-581.
9. H. Gehring and J. Hornberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, Proceedings of EUROGEN 99, University of Jyväskylä, Finland (1.999) 57-64.
10. H. Gehring and J. Hornberger, Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia-Pacific J. Oper. Res. 18 (2001) 35-47.
11. B.E. Gillett and L.R. Miller, A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22 (1974) 340-349.
12. J.H. Holland, Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975).
13. J. Hornberger and H. Gehring, Two evolutionary metaheuristics for the vehicle routing problem, with time windows. INFOR 37 (1999) 297-318.
14. J. Hornberger and H. Gehring, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162 (2005) 220-238.
15. S. Jung and B.R. Moon, A hybrid genetic algorithm for the vehicle routing problem with time windows, Proceedings of Genetic and Evolutionary Computation Conference. Morgan. Kaufmann, San Francisco (2002) 1309-1316.
16. G.A.P. Kindervater and M.W.P. Savelsbergh, Vehicle routing: handling edge exchanges. edited by E.H.L. Aarts and J.K. Lenstra, Local search in combinatorial optimization. Wiley, Chichester (1997) 311-336.
17. D. Mester, An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions, Working paper, Institute of Evolution, University of Haifa, Israel (2002).
18. P. Moscato, Memetic algorithms: a short introduction, edited by D. Corne, M. Dorigo and F. Glover, New Ideas in Optimization. McGraw-Hill, New York (1999) 219-234.
19. J.Y. Potvin and S. Bengio, The vehicle routing with time windows - Part II: genetic search. INFORMS J. Comput. 8 (1996) 165-172.
20. C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem., Comput. Oper. Res. 31 (2004) 1985-2002.
21. Y. Rochat and E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 (1995) 147-167.
22. M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 (1987) 254-265.
23. E. Taillard, P. Badeau, M. Gendreau, F. Guertin and J.Y. Potvin, Tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186.
24. K.C. Tan, L.H. Lee and K. Ou, Hybrid genetic algorithms in solving ehlcle routing problems with, time window constraints. Asia-Pacific J. Oper. Res. 18 (2001) 121-130.
25. K.C. Tan, L.H. Lee and K. Ou, A messy genetic algorithm for the vehicle routing problem with time window constraints, Proceedings of the 2001 Congress on Evolutionary Computation, IEEE, Piscataway (2001) 679-686.
26. K.C. Tan, L.H. Lee, Q.L. Zhu and K. Ou, Heuristic methods for the vehicle routing problem with time windows. Artificial Intelligence in Engineering 15 (2001) 281-295.
27. S. Thangiah, Vehicle routing with time windows using genetic algorithms, edited by L. Chambers, Application handbook of genetic algorithms: new frontiers, Vol IL CRC Press, Boca Raton (1995) 253-277.
28. H. Wee Kit, J. Chin and A. Lim, A hybrid search algorithm for the vehicle routing problem with time windows. Int. J. Art. Intell. Tools 10 (2001) 431-449.