원문정보
보안공학연구지원센터(IJMUE)
International Journal of Multimedia and Ubiquitous Engineering
Vol.9 No.7
2014.07
pp.395-402
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Using ant colony algorithm to solve TSP (traveling salesman problem) has some disadvantages as easily plunging into local minimum, slow convergence speed and so on. In order to find the optimal path accurately and rapidly, an improved ant colony algorithm is proposed. Experimental results show that the improved ant colony algorithm has better effectiveness for TSP problems solutions.
목차
Abstract
1. Introduction
2. Traditional Ant Colony Algorithm in Solving TSP
2.1. Quantization of Ants’ Behaviors in Solving TSP with Ant Colony Algorithm
2.2 Ant Colony Algorithm Description in Solving TSP
3. Improved Ant Colony Algorithm in Solving TSP
3.1. Improved Ant Colony Algorithm Strategies
3.2. Improved Ant Colony Algorithm Flow
4. Experiment Result
5. Conclusion
Acknowledgements
References
1. Introduction
2. Traditional Ant Colony Algorithm in Solving TSP
2.1. Quantization of Ants’ Behaviors in Solving TSP with Ant Colony Algorithm
2.2 Ant Colony Algorithm Description in Solving TSP
3. Improved Ant Colony Algorithm in Solving TSP
3.1. Improved Ant Colony Algorithm Strategies
3.2. Improved Ant Colony Algorithm Flow
4. Experiment Result
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보