Comparison of recombination operators in panmictic and cellular GAs to solve a vehicle routing problem

Inteligencia Artificial

Volumn 14, Issue 46, 2010, Pages 34-44

  Bermudez, Carlos ^a   Graglia, Patricia ^a   Stark, Natalia ^a   Salto, Carolina ^a   Alfonso, Hugo ^a  

^a UNIVERSIDAD NACIONAL DE LA PAMPA   (Argentina)

Author keywords

Capacitated vehicle routing problem; Cellular genetic algorithms; Genetic algorithms; Recombination

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; CELLULAR GENETIC ALGORITHMS; CELLULAR MODEL; GENERIC OPERATORS; GENETIC SEARCH; PROBLEM INSTANCES; PROBLEM-SPECIFIC KNOWLEDGE; RECOMBINATION OPERATORS; TRANSPORTATION COST; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; ROUTING ALGORITHMS; VEHICLES;

FLEET OPERATIONS;

EID: 77949747165     PISSN: 11373601     EISSN: None     Source Type: Journal    
DOI: 10.4114/ia.v14i46.1520     Document Type: Article

References (30)

1. E. Alba and B. Dorronsoro. The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 9(2):126-142, April 2005.
2. E. Alba and B. Dorronsoro. Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters, 98(6):225-230, June 2006.
3. Enrique Alba, Francisco Almeida, Maria J. Blesa, J. Cabeza, Carlos Cotta, M. Díaz, Isabel Dorta, Joaquim Gabarró, Coromoto León, J. Luna, Luz Marina Moreno, C. Pablos, Jordi Petit, Angélica Rojas, and Fatos Xhafa. Mallba: A library of skeletons for combinatorial optimisation (research note). In Burkhard Monien and Rainer Feldmann, editors, Euro-Par, volume 2400 of Lecture Notes in Computer Science, pages 927-932. Springer, 2002.
4. Enrique Alba and Bernabé Dorronsoro. A hybrid cellular genetic algorithm for the capacitated vehicle routing problem. In Ajith Abraham, Crina Grosan, and Witold Pedrycz, editors, Engineering Evolutionary Intelligent Systems, volume 82 of Studies in Computational Intelligence, pages 379-422. Springer, 2008.
5. T. Bäck, D. Fogel, and Z. Michalewicz. Handbook of evolutionary computation. Oxford Univ. Press, 1997.
6. Barrie M. Baker and M. A. Ayechew. A genetic algorithm for the vehicle routing problem. Computers and Operations Research, 30(5):787-800, 2003.
7. John E. Bell and Patrick R. McMullen. Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 18(1):41-48, 2004.
8. Jean Berger and Mohamed Barkaoui. A hybrid genetic algorithm for the vehicle routing problem with time windows. In Advances in Artificial Intelligence. 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 44-51. Morgan Kaufmann, 1998.
9. N. Christofides, A. Mingozzi, and P. Toth. The vehicle routing problem. Combinatorial Optimization, pages 315-338, 1979.
10. Jean-François Cordeau, Michel Gendreau, and Gilbert Laporte. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30(2):105-119, 1997.
11. D. Croes. A method to solving traveling salesman problem. Operations Research, 6:791-812, 1958.
12. G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6(1):80-91, 1959.
13. Tim Duncan. Experiments in the use of neighbourhood search techniques for vehicle routing. Technical report, University of Edinburgh, 1995.
14. D. B. Fogel. An evolutionary approach to the travelling salesman problem. Biological Cybernetics, 60(2):139- 144,1988.
15. Mario Giacobini, Enrique Alba, Andrea Tettamanzi, and Marco Tomassini. Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms, volume 3102 of Lecture Notes in Computer Science, pages 1138-1149 Springer, 2004.
16. Mario Giacobini, Enrique Alba, and Marco Tomassini. Selection intensity in asynchronous cellular evolu- tionary algorithms. In Erick Cantú-Paz, James A. Foster, Kalyanmoy Deb, Lawrence Davis, Rajkumar Roy, Una-May O'Reilly, Hans-Georg Beyer, Russell K. Standish, Graham Kendall, Stewart W. Wilson, Mark Harman, Joachim Wegener, Dipankar Dasgupta, Mitchell A. Potter, Alan C. Schultz, Kathryn A. Dowsland, Natasa Jonoska, and Julian F. Miller, editors, GECCO, volume 2723 of Lecture Notes in Computer Science, pages 955-966. Springer, 2003.
17. David E. Goldberg and Robert Lingle Jr. Alleles, loci, and the traveling salesman problem. In John J. Grefen- stette, editor, Proceedings of the 1st International Conference on Genetic Algorithms and their Applications, pages 154-159, Pittsburgh, PA, July 1985. Lawrence Erlbaum Associates.
18. B.L. Golden, E.A. Wasil, J.P. Kelly, and I.M. Chao. Metaheuristics in vehicle routing, volume Fleet Man- agement and Logistics, pages 33-56. Kiuwer, Boston, t.g crainic and c. laporte edition, 1998.
19. Lenstra J. and Kan A.R. Complexity of vehicle routing and scheduling problems. Networks, 11:221-227, 1981.
20. Jcell. Software NEO group. University of Malaga.
21. K.L. Mak and Z.G. Guo. A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows. In Systems and Information Engineering Design Symposium, 2004. Proceedings of the 2004 IEEE, pages 183-190, April 2004.
22. Zbigniew Michalewicz. Genetic Algorithms + Data Structures = Evolutions Programs (Third, Revised and Extended Edition). Springer-Verlag, Berlin Heidelberg New York, 1999.
23. Yuichi Nagata and Olli Bräysy. Efficient local search limitation strategies for vehicle routing problems. In EvoCOP, pages 48-60, 2008.
24. I.H Osman. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research, 41, 1993.
25. T. Potter and T. Bossomaier. Solving vehicle routing problems with genetic algorithms. In Evolutionary Computation, 1995., IEEE International Conference on, volume 2, pages 788-793 vol.2, Nov-1 Dec 1995.
26. J. Sarma and K.A. De Jong. An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In T. Bäck, editor, ICGA97, pages 181-186. Morgan Kaufmann, 1997.
27. D. Skrlec, M. Filipec, and S. Krajcar. A heuristic modification of genetic algorithm used for solving the single depot capacited vehicle routing problem. In Intelligent Information Systems, 1997. IIS '97. Proceedings, pages 184-188, 8-10 1997.
28. The VRP Web. http://neo.lcc.uma.es/radi-aeb/WebVRP/.
29. Darell Whitley, Timothy Starkweather, and D'Ann Fuquay. Scheduling problems and traveling salesman: The genetic edge recombination operator. pages 133-140, 1989.
30. Yi-Liang Xu, Mene-Hiot Lim, and Meng-Joo Er. Investigation on genetic representations for vehicle routing problem. In Systems, Man and Cybernetics, 2005 IEEE International Conference on, volume 4, pages 3083-3088 Vol. 4, Oct. 2005.