Improved particle swarm optimization for solving traveling salesman problem using MapReduce.
碩士 === 嶺東科技大學 === 資訊科技應用研究所 === 102 === Traveling salesmen problem (TSP) is a typical NP-hard problem. Researchers have proposed many strategies of algorithm to improve the efficiency of solving TSP. However, it also greatly increases the computational complexity, when the numbers of city nodes reas...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12069484818084326601 |