DocumentCode :
3110310
Title :
A Two-Stage Evolutionary Algorithm with Variable Mutation Intervals for Solving Complex Optimization Problems
Author :
Li, Yunhao ; Chen, Shuting
Author_Institution :
Sch. of Inf. Eng., Jiangxi Univ. of Sci. & Technol., Ganzhou, China
fYear :
2009
fDate :
16-18 Dec. 2009
Firstpage :
284
Lastpage :
286
Abstract :
A new evolutionary algorithm called Two-stage Evolutionary Algorithm with Variable Mutation Intervals (TEAVMI) is proposed in this paper. TEAVMI improves the performance of traditional EAs by introducing new evolutionary operators, and it has many new features. It introduces the multi-parent crossover operator with elite-preservation, and develops dynamical mutation operator and space contraction operator; It also introduces a new two-stage algorithm framework. Simulation results on some typical test problems show that TEAVMI is better than existing traditional evolutionary algorithm in the accuracy of solutions.
Keywords :
evolutionary computation; optimisation; complex optimization problem; dynamical mutation operator; elite preservation; evolutionary operator; multiparent crossover operator; space contraction operator; two-stage evolutionary algorithm; variable mutation interval; Algorithm design and analysis; Evolutionary computation; Genetic algorithms; Genetic mutations; Genetic programming; Performance analysis; Testing; evolutionary algorithm; funtion optimization; multi-parent crossover; variable mutation intervals;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Multimedia Technology, 2009. ICIMT '09. International Conference on
Conference_Location :
Jeju Island
Print_ISBN :
978-0-7695-3922-5
Type :
conf
DOI :
10.1109/ICIMT.2009.19
Filename :
5381199
Link To Document :
بازگشت