A new optimization algorithm based on ant colony system with density control strategy

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

Abstract

A new optimization algorithm based on the ant colony system is presented by adopting the density control strategy to guarantee the performance of the algorithm. In each iteration of the algorithm, the solutions are selected to have mutation operations according to the quality and distribution of the solution. Experimental results on the traveling salesman problem show that our algorithm can not only get diversified solutions and higher convergence speed than the Neural Network Model and traditional ant colony algorithm, but also avoid the stagnation and premature problem. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Qin, L., Chen, Y., Chen, L., & Yao, Y. (2006). A new optimization algorithm based on ant colony system with density control strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 385–390). Springer Verlag. https://doi.org/10.1007/11759966_58

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