摘要
约束优化问题是科学和工程应用领域经常会遇到的一类数学规划问题.近年来,约束优化问题求解已成为进化计算研究的一个重要方向.从约束优化进化算法=约束处理技术+进化算法的研究框架出发,从约束处理技术和进化算法两个基本方面对约束优化进化算法的研究及进展进行了综述.此外,对约束优化进化算法中的一些重要问题进行了探讨.最后进行了各种算法的比较性总结,深入分析了目前约束优化进化算法中亟待解决的问题,并指出了值得进一步研究的方向.
Constrained optimization problems （COPs） are mathematical programming problems frequently encountered in the disciplines of science and engineering application. Solving COPs has become an important research area of evolutionary computation in recent years. In this paper, the state-of-the-art of constrained optimization evolutionary algorithms （COEAs） is surveyed from two basic aspects of COEAs （i.e., constraint-handling techniques and evolutionary algorithms）. In addition, this paper discusses some important issues of COEAs. More specifically, several typical algorithms are analyzed in detail. Based on the analyses, it concluded that to obtain competitive results, a proper constraint-handling technique needs to be considered in conjunction with an appropriate search algorithm. Finally, the open research issues in this field are also pointed out.
出处
《软件学报》
EI
CSCD
北大核心
2009年第1期11-29,共19页
Journal of Software
基金
国家自然科学基金Nos.60805027, 60234030, 60673062, 90820302
湖南省院士基金No.06IJY3035
中南大学研究生学位论文创新基金 No.1373-74334000016~~
关键词
进化算法
约束处理技术
约束优化
多目标优化
约束优化进化算法
evolutionary algorithm
constraint-handling technique
constrained optimization
multi-objective optimization
constrained optimization evolutionary algorithms
