Some Aspects of Ant Colony Algorithm

• Main Authors: Yu-Jie Zheng, 鄭宇捷
• Other Authors: Ker-Wei Yu
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/85269700296362976819

碩士 === 國立高雄海洋科技大學 === 輪機工程研究所 === 96 === In this study, a new pheromone reset method for ant colony algorithm to avoid local minima property is investigated. For validation, the comparison between the presented technique and Dorigo’s ant colony optimization algorithm for traveling salesman problems are conduced. Ant Colony System (ACS) is a recently proposed meta-heuristic approach for solving combinatorial optimization problems. In order to get the best optimal solution, the ants in the ACS not only select the route known, but also the route which never tracked. Exploitation and Exploration are the two mechanism for selecting the route. The huge combinatorial optimization problems that the pheromone evaporation rapidly by using traditional ACS algorithm. This study is proposed to add the artificial reset pheromone to improvement solution effect. While the ants are convergence, the pheromone on the route reset and the ants search the solution again. This study provided experiment with some examples form TSPLIB. Adding the artificial reset pheromone can promote the accuracy to well