Affiliation:
1. Jilin Business and Technology College
2. Jilin University of Finance and Economics
Abstract
This paper mainly considers the application of the ant colony in our life. The principle of ant colony optimization, improves the performance of ant colony algorithm, and the global searching ability of the algorithm. We introduce a new adaptive factor in order to avoid falling into local optimal solution. With the increase the number of interations, this factor will benefit the ant search the edge with lower pheromone concentration and avoid the excessive accumulation of pheromone.
Publisher
Trans Tech Publications, Ltd.
Reference6 articles.
1. M. Heusse,S. Guerin,U. Syners, and P. Kuntz. Adaptive agent-driven routing and load Balancing in communication networks. Technical Report RR-98001-IASC . (1998).
2. D. Subramanian,P. Druschel, and J. Chen. Ants and reinforcement learning: A case study in routing in dynamic networks. Proceedings of IJCAI-97International Joint Conference on Artificial Intelligence . (1997).
3. R. van der Put. Routing in the faxfactory using mobile agents. Technical Report R&D-SV-98-276 . (1998).
4. Lu Guoying, Liu Zemin. QoS Multicast Routing Based on Ant Algorithm in Internet. The Jounai of China Universities of Posts ant Telecommunication . (2000).
5. W. L. Pharn, W. C. Chiu. Approximate solutions for the Maximum Benefit Chinese Postman Problem[J]. International Journal of Systems Science, (2005).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献