Towards Efficient Multiobjective Optimization: Multiobjective Statistical Criterions

被引:8
作者
Couckuyt, Ivo
Deschrijver, Dirk
Dhaene, Tom
机构
来源
2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2012年
关键词
multiobjective optimization; Kriging; expected improvement; probability of improvement; GLOBAL OPTIMIZATION; ALGORITHM;
D O I
10.1109/CEC.2012.6256586
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The use of Surrogate Based Optimization (SBO) is widely spread in engineering design to reduce the number of computational expensive simulations. However, "real-world" problems often consist of multiple, conflicting objectives leading to a set of equivalent solutions (the Pareto front). The objectives are often aggregated into a single cost function to reduce the computational cost, though a better approach is to use multiobjective optimization methods to directly identify a set of Pareto-optimal solutions, which can be used by the designer to make more efficient design decisions (instead of making those decisions upfront). Most of the work in multiobjective optimization is focused on MultiObjective Evolutionary Algorithms (MOEAs). While MOEAs are well-suited to handle large, intractable design spaces, they typically require thousands of expensive simulations, which is prohibitively expensive for the problems under study. Therefore, the use of surrogate models in multiobjective optimization, denoted as MultiObjective Surrogate-Based Optimization (MOSBO), may prove to be even more worthwhile than SBO methods to expedite the optimization process. In this paper, the authors propose the Efficient Multiobjective Optimization (EMO) algorithm which uses Kriging models and multiobjective versions of the expected improvement and probability of improvement criterions to identify the Pareto front with a minimal number of expensive simulations. The EMO algorithm is applied on multiple standard benchmark problems and compared against the well-known NSGA-II and SPEA2 multiobjective optimization methods with promising results.
引用
收藏
页数:8
相关论文
共 28 条
[1]  
[Anonymous], 2003, DESIGN ANAL COMPUTER
[2]  
[Anonymous], P 7 INT C AD COMP DE
[3]  
[Anonymous], DASE DESIGN ANAL SIM
[4]  
[Anonymous], THESIS KATHOLIEKE U
[5]   SMS-EMOA: Multiobjective selection based on dominated hypervolume [J].
Beume, Nicola ;
Naujoks, Boris ;
Emmerich, Michael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1653-1669
[6]   On the Complexity of Computing the Hypervolume Indicator [J].
Beume, Nicola ;
Fonseca, Carlos M. ;
Lopez-Ibanez, Manuel ;
Paquete, Luis ;
Vahrenhold, Jan .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (05) :1075-1082
[7]  
Bonnans JF, 2006, NUMERICAL OPTIMIZATI, V2nd, DOI 10.1007/978-3-662-05078-1
[8]   An Efficient Algorithm for Computing Hypervolume Contributions [J].
Bringmann, Karl ;
Friedrich, Tobias .
EVOLUTIONARY COMPUTATION, 2010, 18 (03) :383-402
[9]   Surrogate-Based Infill Optimization Applied to Electromagnetic Problems [J].
Couckuyt, I. ;
Declercq, F. ;
Dhaene, T. ;
Rogier, H. ;
Knockaert, L. .
INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, 2010, 20 (05) :492-501
[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