A new hybrid genetic algorithm for the capacitated vehicle routing problem

Journal of the Operational Research Society

Volumn 54, Issue 12, 2003, Pages 1254-1262

  Berger, J ^a   Barkaoui, M ^a  

^a DEFENCE RESEARCH AND DEVELOPMENT CANADA VALCARTIER   (Canada)

Author keywords

Heuristics; Vehicle routing problems

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COSTS; GENETIC ALGORITHMS; HEURISTIC METHODS; STATISTICAL METHODS; VEHICLES;

COMPUTATIONAL COSTS; VEHICLE ROUTING PROBLEMS (VRP);

OPERATIONS RESEARCH;

EID: 0346276926     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601635     Document Type: Article

References (35)

1. Toth P and Vigo D (2002) (eds). The Vehicle Routing Problem. SIAM Monographs Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, USA.
2. Gendreau M, Laporte G and Potvin J-Y (1998). Metaheuristics for the Vehicle Routing Problem. Les Cahiers du GERAD. G-98-52. Montreal, Canada.
3. Gendreau M. Laporte G and Potvin J-Y (1997). Vehicle routing: Modern heuristics. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimization. Wiley, Chichester, pp 311-336.
4. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Compu Opns Res 13: 533-549.
5. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston.
6. Holland JH (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press: Ann Arbor.
7. Jong De KA (1975). An analysis of the behavior of a class of genetic adaptive systems. PhD dissertation, University of Michigan, USA.
8. Goldberg DE (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley: New York.
9. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
10. Bräysy O and Gendreau M (2004). Vehicle routing problem with time windows, Part 11: metaheuristics to appear in Transportation Sc. http://www.sintef.no/static/am/opti/projects/top/.
11. Dalessandro SV, Ochi LS, de A and Drummond LM (1999). A parallel hybrid evolutionary metaheuristic for the period vehicle routing problem. In: Rolim JDP et al (eds). Proceedings of the IPPS/SPDP 1999, 2nd Workshop on Biologically Inspired Solutions to Parallel Processing Problems, San Juan, Puerto Rico, Springer, pp 183-191.
12. Berger J, Barkaoui M and Bräysy O (2003). A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Inform Systems Opl Res 41: 179-194.
13. Machado P, Tavares J, Pereira F and Costa E (2002). Vehicle routing problem: doing it the evolutionary way. In: Langdon WB et al (eds). Proceedings of the Genetic and Evolutionary Computation Conference New York, USA. Morgan Kaufmann, San Francisco, p 690.
14. Gehring H and Homberger J (2001). Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia-Pacific J Opl Res 18: 35-47.
15. Tan KC, Lee LH and Ou K (2001). Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific J Opl Res 18: 121-130.
16. Thangiah SR, Osman IH, Vinayagamoorthy R and Sun T (1995). Algorithms for the Vehicle Routing Problems with Time Deadlines. Am J Math Mngt Sci 13: 323-355.
17. Thangiah SR (1995). Vehicle routing with time windows using genetic algorithms. In: Chambers L. (ed). Application Handbook of Genetic Algorithms: New Frontiers. Vol. II. CRC Press, Boca Raton, FL, pp 253-277.
18. Thangiah SR (1995). An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Eshelman LJ. (ed). Proceedings of the 6th International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, pp 536-543.
19. Blanton JL and Wainwright RL (1993). Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Forrest S. (ed). Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, pp 452-459.
20. Sangheon Han and Yoshio Tabata (2002). A hybrid genetic algorithm for the vehicle routing problem with controlling lethal gene. Int J Asian Pacific Mngt Rev 7: 287-298.
21. Peiris P and Zak SH (2000). Solving vehicle routing problem using genetic algorithms. Annual Research Summary - Part I -Research, Section 1 - Automatic Control, School of Electrical and Computer Engineering, Purdue University, http://www.ece.purdue.edu/ECE/Research/AR S/ARS2000/PART_I/Section1/1_19.whtml.
22. Shaw P (1998). Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M and Puget J-F (eds.). Principles and Practice of Constraint Programming, Lecture Notes in Computer Science. Springer-Verlag, New York, pp 417-431.
23. Liu F-H. and Shen S-Y (1999). A route-neighbourhood-based metaheuristic for vehicle routing problem with time windows. Eur J Opl Res 118:485-504.
24. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Ops Res 41: 421-451.
25. Toth P and Vigo D (1998). The granular tabu search and its application to the vehicle routing problem. Technical Report OR/ 98/9 DEIS, University of Bologna, Bologna, Italy.
26. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Ops Res 35: 254-265.
27. Harvey WD and Ginsberg ML (1995). Limited discrepancy search. In: Mellish CS (ed). Proceedings of the 14th IJCAI Montreal, Canada. Morgan Kaufmann. San Fransisco, pp 607615.
28. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, pp 315-338.
29. Wall M (1995). GAlib - A C++ Genetic Algorithms Library, version 24. http://lancet.mit.edu/galib-2.4/. MIT: Boston.
30. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing: problem. Mngt Sci 40: 12761290.
31. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for the periodic and multi-depot vehicle routing problems. Networks 30: 105-119.
32. Wark P and Holt J (1994). A repeated matching heuristic for the vehicle routing problem. J Opl Res Soc 45: 1156-1167.
33. Rego C and Roucairol C (1996). A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman IH and Kelly JP (eds). Meta-Heuristics: Theory and Applications. Kluwer, Boston, pp 661-675.
34. Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
35. Taillard ED (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661-673.