DocumentCode
2689595
Title
A good nodes set evolution strategy for constrained optimization
Author
Xiao, Chixin ; Cai, Zixing ; Wang, Yong
Author_Institution
Central South Univ., Changsha
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
943
Lastpage
950
Abstract
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.
Keywords
constraint theory; evolutionary computation; number theory; set theory; constrained optimization problem; crossover operator; evolutionary algorithm; good nodes set evolution strategy; number theory; Constraint optimization; Evolutionary computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424571
Filename
4424571
Link To Document