DocumentCode
2448587
Title
A survey on accelerating evolutionary computation approaches
Author
Pei, Yan ; Takagi, Hideyuki
Author_Institution
Grad. Sch. of Design, Kyushu Univ., Fukuoka, Japan
fYear
2011
fDate
14-16 Oct. 2011
Firstpage
201
Lastpage
206
Abstract
In this paper, we review the research on acceleration convergence approaches of evolutionary computation (EC) and its concrete application in the academy and industry. Evolutionary computation uses iterative progress, which is often inspired by biological mechanisms of evolution, to solve the problems that are multi-modal, multi-objective, discontinuous, non-differential, noisy and not well-defined. In this survey, many acceleration approaches are summarized and clustered in recent two decades. Applications of the acceleration approaches are included. We propose three promising research directions and their concrete approaches. These include including search space landscape approximation, search space projection and search strategy study, and comprise the main further research directions to be implemented an efficient EC search. Finally, we discuss the future research on accelerating convergence approaches of EC, and motivate some new approaches.
Keywords
approximation theory; evolutionary computation; iterative methods; search problems; acceleration convergence approach; biological mechanism; evolutionary computation; iterative progress; search space landscape approximation; search space projection; search strategy study; Acceleration; Approximation methods; Artificial neural networks; Computational modeling; Convergence; Optimization; Search problems; acceleration convergence; evolutionary computation; projection space; search space landscape; search strategy;
fLanguage
English
Publisher
ieee
Conference_Titel
Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of
Conference_Location
Dalian
Print_ISBN
978-1-4577-1195-4
Type
conf
DOI
10.1109/SoCPaR.2011.6089140
Filename
6089140
Link To Document