Abstract
In this paper, a hybrid genetic algorithm for solving constrained optimization problems is addressed. First, a real-coded genetic algorithm is presented. The simplified quadratic interpolation method is then integrated into the genetic algorithm to improve its local search ability and the accuracy of the minimum function value. Simulation results on 13 benchmark problems show that the proposed hybrid algorithm is able to avoid the premature convergence and find much better solutions with high speed compared to other existing algorithms.
This work was supported by the National Natural Science Foundations of China (60171045, 60374063 and 60133010).
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
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)
Runarsson, T.P., Yao, X.: Stochastic Ranking for Constrained Evolutionary Optimization. IEEE Trans. on Evolutionary Computation 4, 284–294 (2000)
Mezura-Montes, E., Coello, C.A.C.: A Simple Multimembered Evolution Strategy to Solve Constrained Optimization Problems. IEEE Trans. on Evolutionary Computation 9, 1–17 (2005)
Ali, M.M., Törn, A., Vitanen, S.: A Numerical Comparison of Some Modified Controlled Random Search Algorithms. Journal of Global Optimization 11, 377–385 (1997)
Hrstka, O., Kučerová, A.: Improvements of Real Coded Genetic Algorithms Based on Differential Operators Preventing Premature Convergence. Advances in Engineering Software 35, 237–246 (2004)
Preux, P., Talbi, E.-G.: Towards Hybrid Evolutionary Algorithms. International Transactions in Operational Research 6, 557–570 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, H., Jiao, YC., Wang, Y. (2005). Integrating the Simplified Interpolation into the Genetic Algorithm for Constrained Optimization Problems. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_35
Download citation
DOI: https://doi.org/10.1007/11596448_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)