An Entropy-Based Ant Colony Optimization Algorithm forTraveling Salesman Problems
碩士 === 國立臺灣科技大學 === 電機工程系 === 94 === In this thesis, we propose a dynamic updating rule for the heuristic parameters based on entropy to improve the efficiency of ant colony optimization (ACO) in solving the traveling salesman problem (TSP). Our algorithm also proposes to use a lower pheromone trail...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/84525576238430302287 |