Optimised crossover genetic algorithm for capacitated vehicle routing problem

Applied Mathematical Modelling

Volumn 36, Issue 5, 2012, Pages 2110-2117

  Nazif, Habibeh ^a   Lee, Lai Soon ^a  

^a UNIVERSITY PUTRA MALAYSIA   (Malaysia)

Author keywords

Combinatorial optimisation; Genetic algorithm; Heuristics; Network; Vehicle routing problem

Indexed keywords

BIPARTITE GRAPHS; CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL RESULTS; CROSSOVER OPERATOR; DELIVERY ROUTES; HEURISTICS; OPTIMAL SETS; TOTAL COSTS; VEHICLE ROUTING PROBLEM;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; NETWORK ROUTING; NETWORKS (CIRCUITS); OPTIMIZATION; ROUTING ALGORITHMS;

VEHICLES;

EID: 84855862424     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2011.08.010     Document Type: Article

References (36)

1. P. Toth, D. Vigo, The vehicle routing problem, in: P. Toth, D. Vigo, (Eds.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, USA, 2002.
2. Laporte G., Gendreau M., Potvin J.Y., Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operations Research 2000, 7:285300.
3. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 2002, 53:512522.
4. Cordeau J.F., Gendreau M., Hertz A., Laporte G., Sormany J.S. New heuristics for the vehicle routing problem. Logistics Systems: Design and Optimization 2005, 279297. Springer, New York. A. Langevin, D. Riopel (Eds.).
5. Taillard É. Parallel iterative search methods for vehicle routing problems. Networks 1993, 23(8):661-673.
6. Rochat Y., Taillard É. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1995, 1:147-167.
7. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Operations Research 1993, 41:421-451.
8. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994, 40:1276-1290.
9. Rego C., Roucairol C. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. Meta-heuristics: Theory and Applications 1996, Kluwer, Boston. I. Osman, J. Kelly (Eds.).
10. Barbarosoglu G., Ozgur D. A tabu search algorithm for the vehicle routing problem. Computers & Operations Research 1999, 26:255-270.
11. Toth P., Vigo D. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing. 2003, 15:333348.
12. Hiquebran D.T., Alfa A.S., Shapiro A., Gittoes D.H. A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem. Engineering Optimization 1994, 22:77-107.
13. Renaud J., Boctor F.F., Laporte G. An improved petal heuristic for the vehicle routing problem. Journal of the Operational Research Society 1996, 47:329-336.
14. Bullnheimer B., Hartl R.F., Strauss C. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 1999, 89:319-328.
15. Gambardella L., Taillard É., Agazzi G. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. New Ideas in Optimization 1999, 63-76. McGraw-Hill. D. Corne, M. Dorigo, F. Glover (Eds.).
16. Mester D., Bräysy O. Active guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research 2007, 34:2964-2975.
17. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 2005, 32:2309-2327.
18. Chen A.L., Yang G.K., Wu Z.M. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A 2006, 7:607614.
19. Ai T.J., Kachitvichyanukul V. A particle swarm optimization for the capacitated vehicle routing problem. International Journal of Logistics and SCM Systems. 2007, 2:5055.
20. Ai T.J., Kachitvichyanukul V. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering. 2009, 56:380-387.
21. Potvin J.Y., Dubé D., Robillard C. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Applied Intelligence 1996, 6:241-252.
22. Berger J., Barkaoui M. A hybrid genetic algorithm for the capacitated vehicle routing problem. LNCS 2003, vol. 2723:646-656. Springer-Verlag, Illinois, Chicago, USA. E. Cant-Paz (Ed.).
23. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 2004, 31:1985-2002.
24. Baker B.M., Ayechew M.A. A genetic algorithm for the vehicle routing problem. Computers & Operations Research 2003, 30:787-800.
25. Alba E., Dorronosoro B. Solving the vehicle routing problem by using cellular genetic algorithms. Lecture Notes in Computer Science 2004, vol. 3004:11-20. Springer-Velag, Berlin.
26. Alba E., Dorronosoro B. Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters 2006, 98:225-230.
27. A.V. Breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer-related, and time-related constrains. PhD Thesis. University of Antwerp, RCUA, Belgium, 1994.
28. Golden B., Wasil E., Kelly J., Chao I.M. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results. Fleet Management and Logistics 1998, Kluwer, Boston, pp. 33-56.
29. Holland J.H. Adaptations in Natural and Artificial Systems 1975, The University of Michigan Press, Ann Arbor.
30. Aggarwal C.C., Orlin J.B., Tai R.P. Optimized crossover for the independent set problem. Operations Research 1997, 45:226-234.
31. Balas E., Niehaus W. Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Journal of Heuristics 1998, 4:107-122.
32. Tan K.C., Lee L.H., Zhu Q.L., Ou K. Heuristic method for vehicle routing problem with time windows. Artificial Intelligence in Engineering 2001, 15:281-295.
33. N. Christofides, A. Mingozzi, P. Toth, The vehicle routing problem, in: N. Christofides, A. Mingozzi, P. Toth, (Eds.), Combinatorial Optimization, 1979, pp. 315-338.
34. http://neo.lcc.uma.es/radi-aeb/WebVRP/Problem_Instances/CVRPInstances.html.
35. Reimann M., Doerner K., Hartl R. D-ants: saving based ants divide and conquer the vehicle routing problem. Computers & Operations Research 2004, 31:563-591.
36. Mester D., Bräysy O. Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research 2005, 32:1593-1614.