DocumentCode :
1667566
Title :
Two-way mutation evolution strategies
Author :
Liang, Yong ; Leung, Kwong-Sak
Author_Institution :
Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Shatin, China
Volume :
1
fYear :
2002
Firstpage :
789
Lastpage :
794
Abstract :
In this paper, a new two-way adaptive search mutation strategy is proposed, and a "two-way evolution strategy" (TWES) is established. The experimental results show that TWES yields much faster convergence than classical evolution strategies. This paper also discusses the relationship between the parameter setting and the convergent speed by TWES
Keywords :
adaptive systems; convergence of numerical methods; evolutionary computation; optimisation; search problems; convergence speed; parameter setting; two-way adaptive search mutation strategy; two-way mutation evolution strategies; Computer science; Convergence; Evolution (biology); Evolutionary computation; Genetic algorithms; Genetic mutations; Genetic programming; Optimization methods; Stochastic processes; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
Type :
conf
DOI :
10.1109/CEC.2002.1007026
Filename :
1007026
Link To Document :
بازگشت