Solving the traveling salesman problem using genetic algorithm on Nvidia Cuda GPU
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....
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/44993 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |