Benchmarking evolutionary multiobjective optimization algorithms

被引:0
作者
Mersmann, Olaf [1 ]
Trautmann, Heike [1 ]
Naujoks, Boris [2 ]
Weihs, Claus [1 ]
机构
[1] TU Dortmund Univ, Dept Stat, Dortmund, Germany
[2] TU Dortmund Univ, Dept Comp Sci, Dortmund, Germany
来源
2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2010年
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Choosing and tuning an optimization procedure for a given class of nonlinear optimization problems is not an easy task. One way to proceed is to consider this as a tournament, where each procedure will compete in different 'disciplines'. Here, disciplines could either be different functions, which we want to optimize, or specific performance measures of the optimization procedure. We would then be interested in the algorithm that performs best in a majority of cases or whose average performance is maximal. We will focus on evolutionary multiobjective optimization algorithms (EMOA), and will present a novel approach to the design and analysis of evolutionary multiobjective benchmark experiments based on similar work from the context of machine learning. We focus on deriving a consensus among several benchmarks over different test problems and illustrate the methodology by reanalyzing the results of the CEC 2007 EMOA competition.
引用
收藏
页数:8
相关论文
共 19 条
[1]  
[Anonymous], 2002, Evolutionary algorithms for solving multi-objective problems
[2]  
[Anonymous], 2006, 214 TIK ETH ZUR
[3]   A DIFFICULTY IN THE CONCEPT OF SOCIAL WELFARE [J].
Arrow, Kenneth J. .
JOURNAL OF POLITICAL ECONOMY, 1950, 58 (04) :328-346
[4]  
COOK WD, 1992, ORDIANL INFORM PREFE
[5]  
de Borda J. C, 1781, MEMOIRE ELECTIONS SC
[6]  
EUGSTER MJA, 2008, 30 LUDWIGSMAXIMILIAN
[7]  
Hastie T., 2001, ELEMENTS STAT LEARNI
[8]  
HORNIK K, 2009, RELATIONS DATA STRUC
[9]   Deriving consensus rankings from benchmarking experiments [J].
Hornik, Kurt ;
Meyer, David .
ADVANCES IN DATA ANALYSIS, 2007, :163-+
[10]  
Huang V., 2007, Technical Report