Advertisement
Published in:
2010 | OriginalPaper | Chapter
A Comparative Study of Different Variants of Genetic Algorithms for Constrained Optimization
Authors : Saber M. Elsayed, Ruhul A. Sarker, Daryl L. Essam
Published in: Simulated Evolution and Learning
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.