J4 ›› 2011, Vol. 38 ›› Issue (1): 47-53.doi: 10.3969/j.issn.1001-2400.2011.01.008

• Original Articles • Previous Articles     Next Articles

New differential evolution constrained optimization algorithm

LIU Ruochen;JIAO Licheng;LEI Qifeng;FANG Lingfen   

  1. (Ministry of Education Key Lab. of Intelligent Perception and Image Understanding, Xidian Univ., Xi'an  710071, China)
  • Received:2010-01-07 Online:2011-02-20 Published:2011-04-08
  • Contact: LIU Ruochen E-mail:ruochenenliu@yahoo.com.cn

Abstract:

Most existing differential evolution algorithms for the Constrained Optimization Problem(COP) use the penalty function method to handle constrains, which depends strongly on the penalty parameter. So, this paper transforms the COP into two-objective multi-objective optimization by taking constraints as an objective function. Based on the concept of Pareto, the grades of individuals in population are prescribed so as to determine their selection probability in the process of “survival of the fittest”. In addition, when the algorithm gets into a local optimum, an infeasible solution replacing mechanism is also given to improve the search capability. The results of the 13 Standard tests show that compared to the Evolutionary Algorithm based on Homomorphous Maps (EAHM), Constraint Handling Differential Evolution (CHDE), Evolutionary Strategies based on Stochastic Ranking (ESSR) and Artificial Immune Response Constrained Evolutionary Strategy (AIRCES), the proposed algorithm has certain advantages in convergence speed and solution accuracy.

Key words: differential evolution algorithm, constrained optimization, multi-objective optimization