Review on the Improvement and Application of Ant Colony Algorithm

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The ant colony optimization algorithm is an approximation algorithm and it is also a probabilistic algorithm for finding optimized paths. Many combinatorial optimization problems have been solved by the ant colony optimization algorithm. Firstly, the basic principles of ant colony algorithm are first introduced by this reference. Secondly, it briefs several improvements method of ant colony algorithm and the application in solving practical problems, including the improvement of ant colony algorithm, parameter combination tuning and the application of ant colony algorithm in combination optimization problem. Finally, the problems existing in the ant colony algorithm are summarized and forecasted in this article.

Cite

CITATION STYLE

APA

Qiao, D., Bai, W., Wang, K., & Wang, Y. (2020). Review on the Improvement and Application of Ant Colony Algorithm. In Communications in Computer and Information Science (Vol. 1159 CCIS, pp. 3–14). Springer. https://doi.org/10.1007/978-981-15-3425-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free