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:
主要作者: | Quang, Mau Bach. |
---|---|
其他作者: | Low Yoke Hean, Malcolm |
格式: | Final Year Project |
語言: | English |
出版: |
2011
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/44993 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Solving traveling salesman problems by genetic algorithms
由: Liang, Y., et al.
出版: (2014) -
Solving traveling salesman problems using generalized chromosome genetic algorithm
由: Yang, J., et al.
出版: (2014) -
Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms
由: Brucal, Stanley Glenn E., et al.
出版: (2017) -
Evolutionary algorithms for solving multi-objective travelling salesman problem
由: Shim, V.A., et al.
出版: (2014) -
Novel approach to solving stochastic constrained shortest path problem with quantum computing
由: Yang, Richard Chen Xiao
出版: (2023)