Solving the traveling salesman problem using genetic algorithm on Nvidia Cuda GPU

• Main Author: Quang, Mau Bach.
• Other Authors: Low Yoke Hean, Malcolm
• Format: Final Year Project
• Language: English
• Published: 2011
• Subjects: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• Online Access: http://hdl.handle.net/10356/44993
• Institution: Nanyang Technological University

The Traveling Salesman Problem (TSP) is one of the most intensively studied problems in computational mathematics. TSP has been used as a benchmark for many new algorithm ideas and optimization methods. Exact method for solving TSP, which has practically acceptable running time, has not been found....