Abstract
This paper proposes a Binary Ant System (BAS), a binary version of the hyper-cube frame for Ant Colony Optimization applied to unconstrained function optimization problem. In BAS, artificial ants construct the solutions by selecting either 0 or 1 at every bit stochastically biased by the pheromone level. For ease of implementation, the pheromone value is designed specially to directly represent the probability of selection. Principal settings of the parameters are analyzed and some methods to escape local optima, such as local search and pheromone re-initialization are incorporated into the proposed algorithm. Experimental results show that the BAS is able to find very good results for the unconstrained function optimization problems of different characteristics.
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
Preview
Unable to display preview. Download preview PDF.
References
Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)
Bilchev, G., Parmee, I.C.: Constrained optimization with an ant colony search model. In: Proceedings of 2nd International Conference on Adaptive Computing in Engineering Design and Control, PEDC, University of Plymouth, pp. 26–28 (1996)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Tran. on Man, Systems and Cybernetics(B) 34(2), 1161–1172 (2004)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems. Oxford University Press, Oxford (1999)
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dipartimento Di Elettronicaq – Politecnico Di Milano (1991)
Dorigo, M., Stützle, T.: Ant colony optimization. The MIT Press, Cambridge (2004)
Dreo, J., Siarry, P.: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 216–221. Springer, Heidelberg (2002)
Dreo, J., Siarry, P.: Continuous interacting ant colony algorithm based on dense heterarchy. Future Generation Computer Systems 20, 841–856 (2004)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Doctoral dissertation, University of Michigan (1975)
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)
Mathur, M., Karale, S.B., Priye, S., Jyaraman, V.K., Kulkarni, B.D.: Ant colony approach to continuous function optimization. Ind. Eng. Chem. Res. 39, 3814–3822 (2000)
Monmarchè, N., Venturini, G., Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems 16, 937–946 (2000)
Wodrich, M., Bilchev, G.: Cooperative distributed search: the ant’s way. Control & Cybernetics 3, 413–446 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, M., Tian, P. (2005). A Binary Ant Colony Optimization for the Unconstrained Function Optimization Problem. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_101
Download citation
DOI: https://doi.org/10.1007/11596448_101
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)