A Two-Level Genetic Algorithm for Electromagnetic Optimization

被引:38
作者
Crevecoeur, Guillaume [1 ]
Sergeant, Peter [1 ,2 ]
Dupre, Luc [1 ]
Van de Walle, Rik [3 ]
机构
[1] Univ Ghent, Dept Elect Energy Syst & Automat, B-9000 Ghent, Belgium
[2] Ghent Univ Coll, Dept Electrotechnol, Fac Appl Engn Sci, Ghent, Belgium
[3] Univ Ghent, Dept Elect & Informat Syst, B-9000 Ghent, Belgium
关键词
Computationally efficient; genetic algorithm; inverse problem; optimization; shielding; two-level optimization; TEAM Workshop Problem 25; ARTIFICIAL NEURAL-NETWORKS; SPACE-MAPPING ALGORITHM; DESIGN; FRAMEWORK; MODELS;
D O I
10.1109/TMAG.2010.2044186
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Optimizing complex engineering problems may demand large computational efforts because of the use of numerical models. Global optimization can be established through the use of evolutionary algorithms, but may demand a prohibitive amount of computational time. In order to reduce the computational time, we incorporate in the global optimization procedures a physics-based fast coarse model. This paper presents a two-level genetic algorithm (2LGA) for electromagnetic optimization. This algorithm employs the global convergence properties of the genetic algorithm, where acceleration of the optimization results from the fast computations of the coarse model (low level) and where accuracy is guaranteed by using a limited number of fine model (high level) evaluations. Using the coarse model, we iteratively build surrogate models (intermediate levels) where metamodels produce surrogate models which approximate the fine model. The proposed algorithm comprises internal parameters which are self-tunable. We applied the 2LGA to the optimization of an algebraic test function, to the optimization of a die press model (TEAM Workshop Problem 25) and to the optimization of an octangular double-layered electromagnetic shield. The results show that the 2LGA is converging to the optimal solutions as the traditional genetic algorithm and that the acceleration is dependent on the accuracy of the low level. An acceleration factor of more than two can be achieved.
引用
收藏
页码:2585 / 2595
页数:11
相关论文
共 36 条
[1]   A trust-region framework for managing the use of approximation models in optimization [J].
Alexandrov, NM ;
Dennis, JE ;
Lewis, RM ;
Torczon, V .
STRUCTURAL OPTIMIZATION, 1998, 15 (01) :16-23
[2]   Simulated annealing with restarts for the optimization of electromagnetic devices [J].
Alfonzetti, S ;
Dilettoso, E ;
Salerno, N .
IEEE TRANSACTIONS ON MAGNETICS, 2006, 42 (04) :1115-1118
[3]   A proposal for a universal parameter configuration for genetic algorithm optimization of electromagnetic devices [J].
Alfonzetti, S ;
Dilettoso, E ;
Salerno, N .
IEEE TRANSACTIONS ON MAGNETICS, 2001, 37 (05) :3208-3211
[4]   Stochastic algorithms in electromagnetic optimization [J].
Alotto, PG ;
Eranda, C ;
Brandstatter, B ;
Furntratt, G ;
Magele, C ;
Molinari, G ;
Nervi, M ;
Preis, K ;
Repetto, M ;
Richter, KR .
IEEE TRANSACTIONS ON MAGNETICS, 1998, 34 (05) :3674-3684
[5]  
[Anonymous], 1987, Unconstrained Optimization: Practical Methods of Optimization
[6]  
Baker J.E., 1987, P 2 INT C GEN ALG TH, V1, P14
[7]   A trust region aggressive space mapping algorithm for EM optimization [J].
Bakr, MH ;
Bandler, JW ;
Biernacki, RM ;
Chen, SH ;
Madsen, K .
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 1998, 46 (12) :2412-2425
[8]   A hybrid aggressive space-mapping algorithm for EM optimization [J].
Bakr, MH ;
Bandler, JW ;
Georgieva, N ;
Madsen, K .
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 1999, 47 (12) :2440-2449
[9]   Space mapping: The state of the art [J].
Bandler, JW ;
Cheng, QSS ;
Dakroury, SA ;
Mohamed, AS ;
Bakr, MH ;
Madsen, K ;
Sondergaard, J .
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 2004, 52 (01) :337-361
[10]   A space-mapping interpolating surrogate algorithm for highly optimized EM-based design of microwave devices [J].
Bandler, JW ;
Hailu, DM ;
Madsen, K ;
Pedersen, F .
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 2004, 52 (11) :2593-2600