Solving Traveling Salesman Problem by Weighted Max-Min Ant System
碩士 === 國立臺灣海洋大學 === 河海工程學系 === 96 === Solving traveling salesman problem (TSP) by integer programming we often spend a lot of time and inefficient when the problem scale to be large. For this reason, in order to improve efficiency the Meta-Heuristics become more important gradually such as Genetic A...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/62220589907867245934 |