CUDA-based genetic algorithm on traveling salesman problem

Studies in Computational Intelligence

Volumn 364, Issue , 2011, Pages 241-252

  Chen, Su ^a   Davis, Spencer ^a   Jiang, Hai ^a   Novobilski, Andy ^a  

^a ARKANSAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79960938276     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-21378-6_19     Document Type: Conference Paper

References (13)

1. Nvidia cuda c programming guide 3.1 (2009)
2. Nvidia fermi tuning guide (2009)
3. Barricelli, N.A.: Esempi numerici di processi di evoluzione. Methodos, 45-68 (1954)
4. Barricelli, N.A.: Symbiogenetic evolution processes realized by artificial methods. Methodos 9, 143-182 (1957)
5. Croes, G.A.: A method for solving travling salesman problems. Operations Res. 6(1), 791-812 (1958)
6. Debattisti, S.: Implementation of a simple genetic algorithm within the cuda architecture. In: The Genetic and Evolutionary Computation Conference (2009)
7. Fraser, A.: Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Science 10, 484-499 (1957)
8. Fraser, A., Burnell, D.: Computer models in genetics. Computers and Security 13, 69-78 (1970)
9. Fraser, A., Burnell, D.: Computer Models in Genetics. McGraw-Hill, New York (1970)
10. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Lkuwer Academic Publishers (1989)
11. Muhlenbein, H.: Parallel genetic algorithm, population dynamic and combinational optimization. In: Proc. 3rd, International Conference on Genetic Algorithms (1989)
12. Ismail, M.A.: Parallel genetic algorithms (PGAs): master slave paradigm approach using MPI. E-Tech (2004)
13. Pospichal, P., Jaros, J.: Gpu-based acceleration of the genetic algorithm. In: Genetic and Evolutionary Computation Conference (2009)