A lower-dimensional-search evolutionary algorithm and its application in constrained optimization problems

This paper proposes a new evolutionary algorithm, called lower-dimensional-search evolutionary algorithm (LDSEA). The crossover operator of the new algorithm searches a lower-dimensional neighbor of the parent points where the neighbor center is the barycenter of the parents therefore the new algorithm converges fast, especially for high-dimensional constrained optimization problems. The niche-impaction operator and the mutation operator preserve the diversity of the population to make the LDSEA algorithm not to be trapped in local optima as much as possible. What's more is that the LDSEA algorithm is simple and easy to be implemented. We have used the 24 constrained benchmark problems [18] to test the LDSEA algorithm. The experimental results show it works better than or competitive to a known effective algorithm [7] for higher-dimensional constrained optimization problems.

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

[2]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[3]  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.

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

[5]  X. Yao,et al.  Evolutionary search and constraint violations , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[6]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Abdelhay A. Sallam,et al.  Swarming of intelligent particles for solving the nonlinear constrained optimization problem , 2001 .

[8]  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).

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

[10]  Vassilios Petridis,et al.  Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of the Dynamic Penalty Terms , 1998, PPSN.

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

[12]  Patrick D. Surry,et al.  The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms , 1997 .

[13]  Carlos A. Coello Coello,et al.  Handling constraints using multiobjective optimization concepts , 2004 .

[14]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[15]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[16]  T. Takahama,et al.  Learning fuzzy control rules by a constrained Powell's method , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

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

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