An ACO Algorithm with Adaptive Volatility Rate of Pheromone Trail
Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as TSP. The volatility rate of pheromone trail is one of the main parameters in ACO algorithms. It is usually set experimentally in the literatures for the application of ACO. The present paper proposes an adaptive strategy for the volatility rate of pheromone trail according to the quality of the solutions found by artificial ants. The strategy is combined with the setting of other parameters to form a new ACO algorithm. Finally, the experimental results of computing traveling salesman problems indicate that the proposed algorithm is more effective than other ant methods.
KeywordsAnt colony optimization pheromone trail adaptive volatility rate
- 4.Watanabe, I., Matsui, S.L.: Improving the Performance of ACO Algorithms by Adaptive Control of Candidate Set. In: The 2003 Congress on Evolutionary Computation, CEC ’03, 8-12 Dec. 2003, vol. 2, pp. 1355–1362 (2003)Google Scholar
- 6.Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning approach to the travelling salesman problem. In: Proceedings of ML-95, Twelfth Intern. Conf. On Machine Learning, pp. 252–260. Morgan Kaufmann, San Francisco (1995)Google Scholar
- 8.Sun, J., Xiong, S.W., Guo, F.M.: A new pheromone updating strategy in ant colony optimization. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, vol. 1, pp. 620–625 (2004)Google Scholar