Abstract
This paper presents an improved GuoTao algorithm for solving unconstrained optimization problems. The algorithm combines the multi-parent crossover operator of GuoTao algorithm with two local search operators. The first local search operator is a simplified Hooke-Jeeves algorithm which can find near-optimal solutions near the start point within reasonable computational time. And the second local search operator is a powell algorithm which can find the local optimal solution near the start point. The multi-parent crossover operator can enables individual to draw closer to each local optimal solution, thus the population will be divided into subpopulations automatically, meanwhile, the first local search operator is adopted to gain near-optimal solution in each subpopulation. As a result, the promising areas are gained quickly which decrease useless search greatly. At last, the second local search operator is adopted to find the global optimal solution only from those promising areas.Numerical experiments using a suite of test functions, which are widely studied in the field of evolutionary computation, show that the proposed algorithm is superior to GuoTao algorithm for solving unconstrained optimization problems with high dimensionality.
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
Holland, J.H.: Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1975)
Rechenberg, I.: Evolutionsstrategie: optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann-Holzboog, Stuttgart (1973)
Schwefel, H.P.: Numerical Optimization of Computer Models. John Wiley, Chichester (1981)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. John Wiley, New York (1966)
Koza, J.R.: Genetic Programming: on the programming of computers by means of natural election. MIT Press, Cambridge (1992)
Yao, X., Xu, Y.: Recent Advances in Evolutionary Computation. Journal of Computer Science and Technology 21(1), 1–18 (2006)
Tao, G., Li-shan, K.: A New Evolutionary Algorithm for Function Optimization. Wuhan University Journal of Nature Sciences 4(4), 409–414 (1999)
Grosan, C., Abraham, A.: Hybrid Evolutionary Algorithms: Methodologies, Architectures, and Reviews. Studies in Computational Intelligence (SCI) 75, 1–17 (2007)
Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS, vol. 3171, pp. 385–394. Springer, Heidelberg (2004)
Walsh, G.R.: Methods of Optimization. John Wiley and Sons, London (1975)
Findeisen, W., Szymanowski, J., Wierzbicki, A.: Teoria i metody obliczeniowe optymalizacji. PWN, Warszawa (1980)
De Jong, K.A.: An Analysis of Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan, Ann Arbor, Michigan (1975)
Griewangk, A.O.: Generalized Descent for Global Optimization. JOTA 34, 11–39 (1981)
Pan, Z.J., Kang, L.S., Chen, Y.P.: Evolutionary Computation, pp. 67–68. Tsinghua University Press, Beijing (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Z., Kang, L., Liu, L. (2008). Improved GuoTao Algorithm for Unconstrained Optimization Problems. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-92137-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92136-3
Online ISBN: 978-3-540-92137-0
eBook Packages: Computer ScienceComputer Science (R0)