Abstract
It has been found that both evolutionary programming (EP) and fast EP (FEP) could get stuck in local optima on some test functions. Although a number of methods have been developed to solve this problem, nearly all have focused on how to adjust search step sizes. This paper shows that it is not enough to change the step sizes alone. Besides step control, the shape of search space should be changed so that the search could be driven to other unexplored regions without getting stuck in the local optima. A two-level FEP with deletion is proposed in this paper to make FEP robust on finding better solutions in function optimisation. A coarse-grained search in the upper level could lead FEP to generate a diverse population, while a fine-grained search in the lower level would help FEP quickly find a local optimum in a region. After FEP could not make any progress after falling in a local optimum, deletion would be applied to change the search space so that FEP could start a new fine-grained search from the points generated by the coarse-grained search.
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
Fogel, D.B.: System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling. Ginn Press, Needham Heights (1991)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3(2), 82–102 (1999)
Yao, X., Liu, Y.: Scaling up evolutionary programming algorithms. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 103–112. Springer, Heidelberg (1998)
Yao, X., Lin, G., Liu, Y.: An analysis of evolutionary algorithms based on neighbourhood and step sizes. In: Angeline, P.J., McDonnell, J.R., Reynolds, R.G., Eberhart, R. (eds.) EP 1997. LNCS, vol. 1213, pp. 297–307. Springer, Heidelberg (1997)
Bäck, T., Schwefel, H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation 1(1), 1–23 (1993)
Feller, W.: An Introduction to Probability Theory and Its Applications, 2nd edn. John Wiley & Sons, Inc., Chichester (1971)
Hunt, R.A.: Calculus with Analytic Geometry. Harper & Row Publ. Inc., New York 5299–10022 (1986)
Potter, M.A., De Jong, K.A.: A cooperative co-evolutionary approach to function optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994)
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
Liu, Y., Yao, X. (2006). Make Fast Evolutionary Programming Robust by Search Step Control. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_107
Download citation
DOI: https://doi.org/10.1007/11881070_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45901-9
Online ISBN: 978-3-540-45902-6
eBook Packages: Computer ScienceComputer Science (R0)