A two-level subspace evolutionary algorithm for solving multi-modal function optimization problems |
| |
Authors: | Email author" target="_blank">Li?YanEmail author Kang?Zhuo |
| |
Institution: | (1) Computation Center, Wuhan University, 430072 Wuhan, Hubei, China |
| |
Abstract: | In this paper, a new algorithm for solving multimodal function optimization problems-two-level subspace evolutionary algorithm
is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population
can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary
strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The
new algorithm has been tested on some hard problems and some good results are obtained.
Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043, 60133010).
Biography: Li Yan( 1974-), female, Ph. D candidate, research interest: evolutionary computation. |
| |
Keywords: | multi-modal function subspace search evolutionary algorithm |
本文献已被 SpringerLink 等数据库收录! |
|