Abstract
Several metaheuristic approaches for global optimization (GO) are investigated and their performances compared in this paper. We critically review and analyze recently proposed Stochastic Genetic Algorithm (StGA) for GO and compare it with our GO hybrid metaheuristic called Genetic LP τ and Simplex Search (GLP τ S), which combines the effectiveness of Genetic Algorithms during the early stages of the search with the advantages of Low-Discrepancy sequences and the local improvement abilities of Simplex search. For comparison purposes we also use Fast Evolutionary Programming (FEP) and Differential Evolution (DE) methods. In parallel to our method, FEP and DE, we investigate further, re-run and test the StGA implementation on a number of multimodal mathematical functions. The obtained StGA results demonstrate inferior performance (compared with our GLP τ S and DE methods), producing much worse than the reported in [1] results (with the only exception for the two-dimensional cases). We argue that the published in [1] accuracy and convergence speed results (given as number of function evaluations) are incorrect for most of the testing functions and investigate why the method is failing in those cases.
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.
Similar content being viewed by others
References
Tu, Z., Lu, Y.: A Robust Stochastic Genetic Algorithm (StGA) for Global Numerical Optimization. IEEE Trans. on Evolutionary Computation 8(5), 456–470 (2004)
Jordanov, I., Georgieva, A.: Neural Network Learning with Global Heuristic Search. IEEE Trans. on Neural Networks, 937–942 (2007)
Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. IEEE Trans. on evolutionary Computation 3(2), 82–102 (1999)
Georgieva, A., Jordanov, I.: Global Optimization Based on Novel Heuristics, Low-discrepancy Sequences and Genetic Algorithms. European J. of Oper. Research (to appear, 2008)
Price, K., Storn, R., Lampinen, J.: Differential Evolution: A Practical Approach to Global Optimization. Springer, New York (2005)
Joines, J., Kay, M.: Utilizing Hybrid Genetic Algorithms. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization, pp. 199–227. Kluwer, Boston (2002)
Hedar, A., Fukushima, M.: Minimizing Multimodal Functions by Simplex Coding Genetic Algorithm. Optimization Methods and Software 18, 265–282 (2003)
Hart, W., Krasnogor, N., Smith, J.: Recent Advances in Memetic Algorithms. In: Studies in Fuzziness and Soft Computing, vol. 166 (2005)
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
Georgieva, A., Jordanov, I. (2008). Hybrid Metaheuristics for Global Optimization: A Comparative Study. In: Corchado, E., Abraham, A., Pedrycz, W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science(), vol 5271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87656-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-87656-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87655-7
Online ISBN: 978-3-540-87656-4
eBook Packages: Computer ScienceComputer Science (R0)