Continuous Ant Colony Algorithm


Article Preview

Ant Colony Algorithm is a new bionics optimization algorithm from mimic the swarm intelligence of ant colony behavior. And it is a very good combination optimization method. To extend the ant colony algorithm, and to improve the searching performance, from the connections of continuous optimization and searching process of ant colony algorithm, one new Continuous Ant Colony Algorithm is proposed. To verify the new algorithm, the typical functions, such as Schaffer function and “Needle-in-a-haystack” function, are all used. And then, the results of new algorithm are compared with that of immunized evolutionary programming proposed by author.



Advanced Materials Research (Volumes 308-310)

Edited by:

Jian Gao






W. Gao "Continuous Ant Colony Algorithm", Advanced Materials Research, Vols. 308-310, pp. 1008-1011, 2011

Online since:

August 2011





[1] M. Dorigo, V. Maniezzo and A. Colorni: IEEE Trans. on SMC Vol. 45 (1996), p.29.

[2] M. Dorigo and T. Stutzle: Ant Colony Optimization (MIT Press, Cambridge 2004).

[3] E. Bonabeau, M. Dorigo and G. Theraulaz: Swarm Intelligence: From Natural to Artificial Systems (Oxford University Press, Oxford 1999).

[4] J. Dréo and P. Siarry: Future Generation Computer Systems Vol. 20 (2004), p.841.

[5] W. Gao and Z.X. Yin: Modern Intelligent Bionics Algorithm and Its Applications (Science Press, Beijing 2011) In Chinese.

[6] Z. Michalewicz: Genetic Algorithms + Data Structures = Evolution Programs (Springer Press, New York 1996).

In order to see related information, you need to Login.