Abstract
Over the last few decades, many different variants of Genetic Algorithms (GAs) have been introduced for solving Constrained Optimization Problems (COPs). However, a comparative study of their performances is rare. In this paper, our objective is to analyze different variants of GA and compare their performances by solving the 36 CEC benchmark problems by using, a new scoring scheme introduced in this paper and, a nonparametric test procedure. The insights gain in this study will help researchers and practitioners to decide which variant to use for their problems.
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
Corder, G.W., Foreman, D.I.: Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach. John Wiley, Hoboken (2009)
Deb, K., Agrawal, R.B.: Simulated Binary Crossover for Continuous Search Space. Complex Syst. 9, 115–148 (1995)
Deb, K., Anand, A., Joshi, D.: A computationally efficient evolutionary algorithm for real-parameter evolution. IEEE Trans. Evol. Comput. 10(4), 371–395 (2002)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186, 311–338 (2000)
Elfeky, E.Z., Sarker, R., Essam, D.: Analyzing the simple ranking and selection process for constrained evolutionary optimization. Journal of Computer Science and Technology 23(1), 19–34 (2008)
Eshelman, L.J., Schaffer, J.D.: Real-Coded Genetic Algorithms and Interval-Schemata. Foundations of Genetic Algorithms 2, 187–202 (1993)
Herrera, F., Lozano, M., Molina, D.: Continuous Scatter Search: An Analysis of the Integration of Some Combination Methods and Improvement Strategies. European Journal of Operational Research 169, 450–476 (2006)
Mallipeddi, R., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC 2010 competition and special session on single objective constrained real-parameter optimization. Tech. Rep., Nangyang Technological University, Singapore (2010)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1992)
Rönkkönen, J.: Multimodal Global Optimization with Differential Evolution-Based Methods. Thesis for the degree of Doctor of Science, Lappeenranta University of Technology, Lappeenranta, Finland (2009) ISBN 978-952-214-851-3
Takahashi, M., Kita, M.: A Crossover Operator Using Independent Component Analysis for Real-Coded Genetic Algorithms. In: IEEE Congress on Evolutionary Computation, pp. 643–649 (2002)
Tsutsui, S., Yamamura, M., Higuchi, T.: Multi-parent Recombination with Simplex Crossover in Real Coded Genetic Algorithms. In: Genetic Evolutionary Computation Conf. (GECCO 1999), pp. 657–664 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elsayed, S.M., Sarker, R.A., Essam, D.L. (2010). A Comparative Study of Different Variants of Genetic Algorithms for Constrained Optimization. In: Deb, K., et al. Simulated Evolution and Learning. SEAL 2010. Lecture Notes in Computer Science, vol 6457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17298-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-17298-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17297-7
Online ISBN: 978-3-642-17298-4
eBook Packages: Computer ScienceComputer Science (R0)