Abstract
Ant colony optimization has been one of the most promising meta-heuristics since its appearance in early 1990s but it is specialized in discrete space optimization problems. To explore the utility of ACO in the filed of continuous problems, this paper proposes an orthogonal search embedded ACO (OSEACO) algorithm. By generating some grids in the search space and embedding an orthogonal search scheme into ACO, the search space is learned much more comprehensively with only few computation efforts consumed. Hence, solutions are obtained in higher precision. Some adaptive strategies are also developed to prevent the algorithm from trapping in local optima as well as to improve its performance. Moreover, the effectiveness of this algorithm is demonstrated by experimental results on 9 diverse test functions for it is able to obtain near-optimal solutions in all cases.
Keywords
- Orthogonal Array
- Elitist Strategy
- Orthogonal Experimental Design
- Function Optimization Problem
- Future Generation Computer System
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
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - part B: Cybernetics 26, 29–41 (1996)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to tsp. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5(2), 137–172 (1999)
Parpinelli, R.S., Lopes, H.S., Freitas, A.A.: Data mining with an ant colony optimization algorithm. IEEE Transactions on Evolutionary Computation 4, 321–332 (2002)
Sim, K.M., Sun, W.H.: Ant colony optimization for routing and load-balancing: Survey and new directions. IEEE Transactions on Systems, Man, and Cybernetics - part A: System and Humans 33, 560–572 (2003)
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)
Mathur, M., Karale, S.B., Priye, S., Jayaraman, 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)
Dréo, 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)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Fang, K.T., Wang, Y.: Number-Theoretic Methods in Statistics. Chapman & Hall, New York (1994)
Hedayat, A.S., Solane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer, New York (1999)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 8, 456–470 (2004)
Elberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th Int. Symp. Micromachine Human Sci., Nagoya, Japan, pp. 39–43 (1995)
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
Zhang, J., Chen, Wn., Tan, X. (2006). An Orthogonal Search Embedded Ant Colony Optimization Approach to Continuous Function Optimization. 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_35
Download citation
DOI: https://doi.org/10.1007/11839088_35
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)