Diversity enhanced Adaptive Evolutionary Programming for solving single objective constrained problems

In Evolutionary Algorithms, the occurrence of premature convergence is due to lack of diversity in the population during the search process. The effect may be more predominant if the optimization problem includes constraints. In this paper we propose an explicit memory based diversity enhancement Adaptive Evolutionary Programming (DivEnh-AEP) method to solve constraint optimization problems of CEC 2006.

[1]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[2]  Wei Gao,et al.  Fast immunized evolutionary programming , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[3]  David B. Fogel,et al.  System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling , 1991 .

[4]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[5]  Rasmus K. Ursem,et al.  Diversity-Guided Evolutionary Algorithms , 2002, PPSN.

[6]  A. L. Barker,et al.  Population Diversity and Fitness Measures Based on Genomic Distances , 1999 .

[7]  Xin Yao,et al.  Global optimisation by evolutionary algorithms , 1997, Proceedings of IEEE International Symposium on Parallel Algorithms Architecture Synthesis.

[8]  Ponnuthurai N. Suganthan,et al.  Evaluation of novel adaptive evolutionary programming on four constraint handling techniques , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[9]  Yong Wang,et al.  Improved Evolutionary Programming Algorithm and Its Application Research on the Optimization of Ordering Plan , 2009 .

[10]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[11]  Dario Floreano,et al.  Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes , 2004, Evolutionary Computation.

[12]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[13]  Kengo Katayama,et al.  Evolutionary Programming With Only Using Exponential Mutation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[16]  Yuren Zhou,et al.  An Adaptive Tradeoff Model for Constrained Evolutionary Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[17]  Kengo Katayama,et al.  Exponential Evolutionary Programming Without Self-Adaptive Strategy Parameter , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[19]  Martin Zwick,et al.  Variance and Uncertainty Measures of Population Diversity Dynamics , 1995 .

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

[21]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[22]  Ling Wang,et al.  An improved evolutionary programming for optimization , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

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