Reference Point Based Constraint Handling Method for Evolutionary Algorithm

Many evolutionary algorithms have been proposed to deal with Constrained Optimization Problems COPs. Penalty functions are widely used in the community of evolutionary optimization when coming to constraint handling. To avoid setting up penalty term, we introduce a new constraint handling method, in which a reference point selection mechanism and a population ranking process based on the distances to the selected reference point are proposed. The performance of our method is evaluated on 24 benchmark instances. Experimental results show that our method is competitive when compared with the state-of-the-art approaches and has improved the solution and the optima value of instance g22.

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

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

[3]  Carlos A. Coello Coello,et al.  Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .

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

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

[6]  Yong Wang,et al.  A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization , 2006, IEEE Transactions on Evolutionary Computation.

[7]  N. Hansen,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.

[8]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[10]  Carlos A. Coello Coello,et al.  Constraint-handling in nature-inspired numerical optimization: Past, present and future , 2011, Swarm Evol. Comput..

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

[12]  Yong Wang,et al.  Combining Multiobjective Optimization With Differential Evolution to Solve Constrained Optimization Problems , 2012, IEEE Transactions on Evolutionary Computation.

[13]  Marc Schoenauer,et al.  ASCHEA: new results using adaptive segregational constraint handling , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[14]  Keigo Watanabe,et al.  Evolutionary Optimization of Constrained Problems , 2004 .

[15]  Zbigniew Michalewicz,et al.  A Decoder-Based Evolutionary Algorithm for Constrained Parameter Optimization Problems , 1998, PPSN.

[16]  P. N. Suganthan,et al.  Ensemble of Constraint Handling Techniques , 2010, IEEE Transactions on Evolutionary Computation.

[17]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..