Intelligent evolutionary algorithms for large parameter optimization problems

被引:196
作者
Ho, SY [1 ]
Shu, LS
Chen, JH
机构
[1] Natl Chiao Tung Univ, Inst Bioinformat, Dept Biol Sci & Technol, Hsinchu 300, Taiwan
[2] Feng Chia Univ, Dept Informat Engn & Comp Sci, Taichung 407, Taiwan
关键词
evolutionary algorithm (EA); genetic algorithm (GA); intelligent gene collector (IGC); multiobjective optimization; orthogonal experimental design;
D O I
10.1109/TEVC.2004.835176
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes two intelligent evolutionary algorithms IEA and IMOEA using a novel intelligent gene collector (IGC) to solve single and multiobjective large parameter optimization problems, respectively. IGC is the main phase in an intelligent recombination operator of IEA and IMOEA. Based on orthogonal experimental design, IGC uses a divide-and-conquer approach, which consists of adaptively dividing two individuals of parents into N pairs of gene segments, economically identifying the potentially better one of two gene segments of each pair, and systematically obtaining a potentially good approximation to the best one of all combinations using at most 2N fitness evaluations. IMOEA utilizes a novel generalized Pareto-based scale-independent fitness function for efficiently finding a set of Pareto-optimal solutions to a multiobjective optimization problem. The advantages of IEA and IMOEA are their simplicity, efficiency, and flexibility. It is shown empirically that IEA and IMOEA have high performance in solving benchmark functions comprising many parameters, as compared with some existing EAs.
引用
收藏
页码:522 / 541
页数:20
相关论文
共 48 条
[1]  
[Anonymous], 1985, ORTHOGONAL FRACTIONA
[2]  
[Anonymous], RA01498 POZN U TECHN
[3]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[4]  
Antony J, 2000, QUAL RELIAB ENG INT, V16, P3, DOI 10.1002/(SICI)1099-1638(200001/02)16:1<3::AID-QRE276>3.0.CO
[5]  
2-W
[6]  
Back T., 1997, Handbook of evolutionary computation
[7]  
Bagchi T. P., 1993, Taguchi methods explained: Practical steps to robust design
[8]  
Coello Coello C. A., 1999, INT J, V1, P269, DOI DOI 10.1007/BF03325101
[9]  
CORNE DW, 1998, P 6 INT C PAR PROBL, P839
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197