计算机科学
数学优化
最优化问题
进化算法
集合(抽象数据类型)
作者
Chixin Xiao,Zixing Cai,Yong Wang
出处
期刊:Congress on Evolutionary Computation
日期:2007-09-01
卷期号:: 943-950
被引量:10
标识
DOI:10.1109/cec.2007.4424571
摘要
Good Nodes Set(GNS) is a concept in number theory. To overcome the deficiency of orthogonal design to handle constrained optimization problems(COPs), this paper presents a method that incorporate GNS principle to enhance the crossover operator of the evolution strategy (ES) can make the resulting evolutionary algorithm more robust and statically sound. In order to gain the rapid and stable rate of converging to the feasible region, traditional crossover operator is split into two steps. GNS initialization methods is applied to ensure the initial population span evenly in relatively large search space and reliably locate the good points for further exploration in subsequent iterations. The proposed method achieves the same sound results just as the orthogonal method does, but its precision is not confined by the dimension of the space. The simplex selected and diversity mechanism similar to Carlos's SMES is used to enrich the exploration and exploitation abilities of the approach proposed. Experiment results on a set of benchmark problems show the efficiency of our methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI