DocumentCode :
507776
Title :
(C+M) Evolution Algorithm Analysis Based on Optimization Measurement Principle
Author :
Han, Yu ; Cai, Yunze ; Xu, Xiaoming
Author_Institution :
IIC Dept. of Autom., Shanghai Jiao Tong Univ., Shanghai, China
Volume :
4
fYear :
2009
fDate :
14-16 Aug. 2009
Firstpage :
547
Lastpage :
552
Abstract :
Evolution algorithm (EA) has been widely used in solving optimization problem. But the theory foundation of EA is still not completely clear. This paper first puts forward optimization measurement principle, and then analyzes (crossover+mutation) EA based on it. According to optimization measurement principle we proposed, we deduce a condition that relates all parameters of EA, under which EA can converge fast. Both theory analysis and experiment investigation show this condition could ensure convergence of algorithm efficiently.
Keywords :
evolutionary computation; optimisation; evolution algorithm analysis; optimization measurement principle; optimization problem solving; Algorithm design and analysis; Automation; Convergence; Evolutionary computation; Extraterrestrial measurements; Mathematical model; Mathematics; Optimization methods; Search methods; (1+1) EA; (C+M) Evolution Algorithm; Algorithm Analysis; optimization measurement theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3736-8
Type :
conf
DOI :
10.1109/ICNC.2009.180
Filename :
5363000
Link To Document :
بازگشت