Combining Adaptive Fuzzy Degree and Ant Colony System for TSP
碩士 === 嶺東科技大學 === 資訊科技應用研究所 === 100 === The travel salesman problem (TSP) is an important combinational optimization problem. Being an NP-hard problem, the TSP is unlikely to be solved in polynomial time. Hence a main research effort is to design an effective approach to obtain near optimal solution...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69245713693319354691 |