Abstract
Although ACO has been proved to be an efficient and versatile tool for combinational optimization problems [1,2], it cannot deal with continuous optimization problems directly. Therefore, there are only a few studies on ACO [3] for continuous optimization. This paper presents a novel ACO algorithm (CACO-DE) for continuous optimization based on discrete encoding, which is quite different from other ant methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Massachusetts Institute of Technology, Artificial Life 5, 137–172 (1999)
Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344, 243–278 (2005)
Socha, K.: ACO for continuous and mixed-variable optimization. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 25–36. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, H., Hao, Z. (2006). ACO for Continuous Optimization Based on Discrete Encoding. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_53
Download citation
DOI: https://doi.org/10.1007/11839088_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)