Abstract
This paper proposes a direct application of Ant Colony Optimization to the function optimization problem in continuous domain. In the proposed algorithm, artificial ants construct solutions by selecting values for each variable randomly biased by a specific variable-related normal distribution, of which the mean and deviation values are represented by pheromone modified by ants according to the previous search experience. Some methods to avoid premature convergence, such as local search in different neighborhood structure, pheromone re-initialization and different solutions for pheromone intensification are incorporated into the proposed algorithm. Experimental setting of the parameters are presented, and the experimental results show the potential of the proposed algorithm in dealing with the function optimization problem of different characteristics.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Oxford (1999)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Bilchev, G., Parmee, I.: 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.: Constrained optimization with an ant colony search model. In: 2nd International Conference on Adaptive Computing in Engineering Design and Control, pp. 26–28 (1996)
Mathur, M., Karale, S., Priye, S., Jyaraman, V., Kulkarni, B.: Ant colony approach to continuous function optimization. Ind. Eng. Chem. Res. 39(10), 3814–3822 (2000)
Wodrich, M., Bilchev, G.: Cooperative distributed search: the ant’s way. Control & Cybernetics 3, 413–446 (1997)
Monmarche, N., Venturini, G., Slimane, M.: On how pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems 16(8), 937–946 (2000)
Dréo, 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(5), 841–856 (2004)
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)
Kong, M., Tian, P.: A binary ant colony optimization for the unconstrained function optimization problem. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol. 3801, pp. 682–687. Springer, Heidelberg (2005)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B 34(2), 1161–1172 (2004)
Chelouah, R., Siarry, P.: A continuous genetic algorithm designed for the global optimization of multimodal functions. Journal of Heuristics 6, 191–213 (2000)
Chelouah, R., Siarry, P.: Enhanced continuous tabu search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: advances and trends in local search paradigms for optimization, ch. 4, pp. 49–61. Kluwer Academic Publishers, Dordrecht (1999)
Siarry, P., Berthiau, G., Durbin, F., Haussy, J.: Enhanced simulated annealing for globally minimizing functions of many continuous variables. ACM Transactions on Mathematical Software 23(2), 209–228 (1997)
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
Kong, M., Tian, P. (2006). A Direct Application of Ant Colony Optimization to Function Optimization Problem in Continuous Domain. 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_29
Download citation
DOI: https://doi.org/10.1007/11839088_29
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)