Abstract
Through identifying the main causes of low efficiency of the currently known evolutionary algorithms for difficult function optimization problem, the complementary efficiency speed-up strategy—Fourier series auxiliary function technique is suggested, analyzed, and partially explored. The Fourier series auxiliary function could guide an algorithm to search for optima with small attraction basins efficiently. Incorporation of this technique with any known evolutionary algorithm leads to an accelerated version of the algorithm for the difficult function optimization. As a case study, the developed technique has been incorporated with evolution strategies (ES), yielding accelerated Fourier series auxiliary function evolution strategies: the FES. The experiments demonstrate that the FES consistently outperforms the standard ES in efficiency and solution quality.
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
Folland, G.B.: Fourier Analysis and its Applications. Wadsworth & Brooks/Cole Advanced Book & Software (1998)
Edwards, R.E.: Fourier Series, 2nd edn. Springer, Heidelberg (1999)
Schwefel, H.-P., Rudolph, G.: Contemparary Evolution Strategies. In: Morán, F., Merelo, J.J., Moreno, A., Chacon, P. (eds.) ECAL 1995. LNCS, vol. 929, pp. 893–907. Springer, Heidelberg (1995)
Yao, X.: Evolutionary computation: theory and applications, Singapore. World Scientific, New Jersey (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leung, KS., Liang, Y. (2003). Evolution Strategies with a Fourier Series Auxiliary Function for Difficult Function Optimization. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-45080-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40550-4
Online ISBN: 978-3-540-45080-1
eBook Packages: Springer Book Archive