On the Performance Metrics of Multiobjective Optimization

被引:0
作者
Cheng, Shi [1 ,2 ]
Shi, Yuhui [2 ]
Qin, Quande [3 ]
机构
[1] Univ Liverpool, Dept Elect Engn & Elect, Liverpool, Merseyside, England
[2] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou, Peoples R China
[3] Shenzhen Univ, Coll Management, Shenzhen, Peoples R China
来源
ADVANCES IN SWARM INTELLIGENCE, ICSI 2012, PT I | 2012年 / 7331卷
基金
中国国家自然科学基金;
关键词
Multiobjective Optimization; Performance Metrics; Pareto Front/Set; Reference Point; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiobjective Optimization (MOO) refers to optimization problems that involve two or more objectives. Unlike in the single objective optimization, a set of solutions representing the tradeoff among the different objects rather than an unique optimal solution is sought in MOO. How to measure the goodness of solutions and the performance of algorithms is important in MOO. In this paper, we first review the performance metrics of multiobjective optimization and then classify variants of performance metrics into three categories: set based metrics, reference point based metrics, and the true Pareto front/set based metrics. The properties and drawbacks of different metrics are discussed and analyzed. From the analysis of different metrics, an algorithm's properties can be revealed and more effective algorithms can be designed to solve MOO problems.
引用
收藏
页码:504 / 512
页数:9
相关论文
共 14 条
[1]   Diversity Management in Evolutionary Many-Objective Optimization [J].
Adra, Salem F. ;
Fleming, Peter J. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) :183-195
[2]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[3]   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
[4]  
Hansen M.P., 1998, MMREP19987 TU DENM
[5]  
Knowles J, 2002, IEEE C EVOL COMPUTAT, P711, DOI 10.1109/CEC.2002.1007013
[6]   Properties of an adaptive archiving algorithm for storing nondominated vectors [J].
Knowles, J ;
Corne, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :100-116
[7]   Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II [J].
Li, Hui ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (02) :284-302
[8]  
Okabe T, 2003, IEEE C EVOL COMPUTAT, P878
[9]   A Favorable Weight-Based Evolutionary Algorithm for Multiple Criteria Problems [J].
Soylu, Banu ;
Koksalan, Murat .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (02) :191-205
[10]   A faster algorithm for calculating hypervolume [J].
While, L ;
Hingston, P ;
Barone, L ;
Huband, S .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (01) :29-38