Abstract
The Ant Colony Optimization (ACO) metaheuristic embodies a large set of algorithms which have been successfully applied to a wide range of optimization problems. Although ACO practitioners have a long tradition in solving combinatorial optimization problems, many other researchers have recently developed a variety of ACO algorithms for dealing with continuous optimization problems. One of these algorithms is the so-called ACO\(_{\Bbb{R}}\), which is one of the most relevant ACO algorithms currently available for continuous optimization problems. Although ACO\(_{\Bbb{R}}\) has been found to be successful, to the authors’ best knowledge its use in high-dimensionality problems (i.e., with many decision variables) has not been documented yet. Such problems are important, because they tend to appear in real-world applications and because in them, diversity loss becomes a critical issue. In this paper, we propose an alternative ACO\(_{\Bbb{R}}\) algorithm (DACO\(_{\Bbb{R}}\)) which could be more appropriate for large scale unconstrained continuous optimization problems. We report the results of an experimental study by considering a recently proposed test suite. In addition, the parameters setting of the algorithms involved in the experimental study are tuned using an ad hoc tool. Our results indicate that our proposed DACO\(_{\Bbb{R}}\) is able to improve both, the quality of the results and the computational time required to achieve them.
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
Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation: The New Experimentalism. Natural Computing Series. Springer, New York (2006)
Bartz-Beielstein, T., Preuss, M.: Spot, sequential parameter optimization tool, http://www.gm.fh-koeln.de/campus/personen/lehrende/thomas.bartz-beielstein/00489/
Bilchev, G., Parmee, I.: The Ant Colony Metaphor for Searching Continuous Design Spaces. In: Fogarty, T.C. (ed.) Evolutionary Computing. AISB Workshop, pp. 25–39. Springer, Sheffield (April 1995)
Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization. McGraw-Hill International, London (1999)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
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)
Dréo, J., Siarry, P.: Continuous Interacting Ant Colony Algorithm Based on Dense Heterarchy. Future Generation Comp. Syst. 20(5), 841–856 (2004)
Hu, X., Zhang, J., Li, Y.: Orthogonal methods based ant colony search for solving continuous optimization problems. J. Comput. Sci. Technol. 23(1), 2–18 (2008)
Kong, M., Tian, P.: 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.) ANTS 2006. LNCS, vol. 4150, pp. 324–331. Springer, Heidelberg (2006)
Leguizamón, G., Coello Coello, C.A.: A Study of the Scalability of ACOℝ for Continuous Optimization Problems. Tech. Rep. EVOCINV-01-2010, Evolutionary Computation Group at CINVESTAV, Departamento de Computación, CINVESTAV-IPN, México (February 2010)
Ling, C., Jie, S., Ling, Q., Hongjian, C.: A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 288–289. Springer, Heidelberg (2002)
Ling Chen, J., Shen, L.Q., Chen, H.: An improved ant colony algorithm in continuous optimization. Journal of Systems Science and Systems Engineering 12(2), 224–235 (2003)
Monmarché, N., Venturini, G., Slimane, M.: On how pachycondyla apicalis ants suggest a new search algoritm. Future Generation Computer Systems 16, 937–946 (2000)
Pourtakdoust, S., Nobahari, H.: An Extension of Ant Colony Systems to Continuos Optimization Problems. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 294–301. Springer, Heidelberg (2004)
Socha, K.: ACO for continuos 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)
Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. European Journal of Operational Research 185(3), 1155–1173 (2008)
Tang, K., Yao, X., Suganthan, P.N., MacNish, C., Chen, Y.P., Chen, C.M., Yang, Z.: Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization. Tech. rep., Nature Inspired Computation and Applications Laboratory, USTC, China (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leguizamón, G., Coello, C.A.C. (2010). An Alternative ACO\(_{\Bbb{R}}\) Algorithm for Continuous Optimization Problems. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-15461-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15460-7
Online ISBN: 978-3-642-15461-4
eBook Packages: Computer ScienceComputer Science (R0)