Ant Colony Optimization Improved by Heuristic Methods for Traveling Salesman Problem
碩士 === 國立臺灣科技大學 === 電機工程系 === 94 === The Traveling Salesman Problems(TSP) are well known as NP-hard problems which are difficult and time-consuming. Ant Colony Optimization(ACO) is a new proposed metaheuristic algorithm that has been successfully applied to solving Combinatorial Optimization Problem...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/wv4946 |