A quickly convergent continuous ant colony optimization algorithm with scout ants

DOI10.1016/j.amc.2011.06.065zbMath1269.65058OpenAlexW1966452224MaRDI QIDQ654652

Zhijun Yang, Wei Ma, Qingbao Zhu

Publication date: 29 December 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.06.065

zbMATH Keywords

random searchfunction optimizationchaotic sequenceheuristic informationscout ant

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Related Items (1)

Hybrid real-code ant colony optimisation for constrained mechanical design

Uses Software

• CEC 05

Cites Work

• Ant colony optimization for continuous domains
• Particle swarm and ant colony algorithms hybridized for improved continuous optimization
• Improved particle swarm optimization combined with chaos
• Simple mathematical models with very complicated dynamics

This page was built for publication: A quickly convergent continuous ant colony optimization algorithm with scout ants