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

• 主要作者: Quang, Mau Bach.
• 其他作者: Low Yoke Hean, Malcolm
• 格式: Final Year Project
• 語言: English
• 出版: 2011
• 主題: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• 在線閱讀: http://hdl.handle.net/10356/44993

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....