Analyzing the Simple Ranking and Selection Process for Constrained Evolutionary Optimization

Many optimization problems that involve practical applications have functional constraints, and some of these constraints are active, meaning that they prevent any solution from improving the objective function value to the one that is better than any solution lying beyond the constraint limits. Therefore, the optimal solution usually lies on the boundary of the feasible region. In order to converge faster when solving such problems, a new ranking and selection scheme is introduced which exploits this feature of constrained problems. In conjunction with selection, a new crossover method is also presented based on three parents. When comparing the results of this new algorithm with six other evolutionary based methods, using 12 benchmark problems from the literature, it shows very encouraging performance. T-tests have been applied in this research to show if there is any statistically significance differences between the algorithms. A study has also been carried out in order to show the effect of each component of the proposed algorithm.

[1]  Charles S. Newton,et al.  Evolutionary Optimization (Evopt): A Brief Review And Analysis , 2003, Int. J. Comput. Intell. Appl..

[2]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[3]  Ruhul A. Sarker,et al.  A Simple Ranking and Selection for Constrained Evolutionary Optimization , 2006, SEAL.

[4]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[5]  Helio J. C. Barbosa,et al.  A new adaptive penalty scheme for genetic algorithms , 2003, Inf. Sci..

[6]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[7]  Z. Michalewicz.  Genetic Algorithms , Numerical Optimization , and Constraints , 1995 .

[8]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

[9]  Zbigniew Michalewicz,et al.  A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems , 1996, Evolutionary Programming.

[10]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[11]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[12]  Xiao-Shan Gao,et al.  Evolutionary programming based on non-uniform mutation , 2007, Appl. Math. Comput..

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[14]  Xin Yao,et al.  Search biases in constrained evolutionary optimization , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[15]  Gary G. Yen,et al.  A generic framework for constrained optimization using genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[16]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

[17]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .