西安电子科技大学学报（自然科学版）2011，Vol.38Issue(1)：47-53,7.DOI:10.3969/j.issn.1001-2400.2011.01.008
一种新的差分进化约束优化算法
New differential evolution constrained optimization algorithm
摘要
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.关键词
差分进化算法/约束优化/多目标优化分类
信息技术与安全科学引用本文复制引用
刘若辰,焦李成,雷七峰,方玲芬..一种新的差分进化约束优化算法[J].西安电子科技大学学报（自然科学版）,2011,38(1):47-53,7.基金项目
国家自然科学基金资助项目(60803098,60703108) （60803098,60703108）
国家教育部博士点基金资助项目(20070701022) （20070701022）
中国博士后科学基金资助项目(20080431228,20090451369) （20080431228,20090451369）
陕西省自然科学基金资助项目(2009JQ8015) （2009JQ8015）
