The Averaged Hausdorff Distances in Multi-Objective Optimization: A Review

被引:28
作者
Bogoya, Johan M. [1 ]
Vargas, Andres [1 ]
Schutze, Oliver [2 ,3 ]
机构
[1] Pontificia Univ Javeriana, Dept Matemat, Cra 7 40-62, Bogota 111321, DC, Colombia
[2] IPN, CINVESTAV, Comp Sci Dept, Av IPN 2508, Mexico City 07360, DF, Mexico
[3] UAM Cuajimalpa, Mexico City 05348, DF, Mexico
关键词
Averaged Hausdorff distance; evolutionary multi-objective optimization; Pareto compliance; performance indicator; power means; PARTICLE SWARM OPTIMIZATION; SCHEDULING PROBLEM; ALGORITHM; COMPUTATION; APPROXIMATION; CONTINUATION; MANIFOLDS; MOEA/D; BERTH;
D O I
10.3390/math7100894
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A brief but comprehensive review of the averaged Hausdorff distances that have recently been introduced as quality indicators in multi-objective optimization problems (MOPs) is presented. First, we introduce all the necessary preliminaries, definitions, and known properties of these distances in order to provide a stat-of-the-art overview of their behavior from a theoretical point of view. The presentation treats separately the definitions of the (p, q)-distances GD(p,q), IGD(p,q), and Delta(p,q) for finite sets and their generalization for arbitrary measurable sets that covers as an important example the case of continuous sets. Among the presented results, we highlight the rigorous consideration of metric properties of these definitions, including a proof of the triangle inequality for distances between disjoint subsets when p, q >= 1, and the study of the behavior of associated indicators with respect to the notion of compliance to Pareto optimality. Illustration of these results in particular situations are also provided. Finally, we discuss a collection of examples and numerical results obtained for the discrete and continuous incarnations of these distances that allow for an evaluation of their usefulness in concrete situations and for some interesting conclusions at the end, justifying their use and further study.
引用
收藏
页数:35
相关论文
共 66 条
[51]   On the Influence of the Number of Objectives on the Hardness of a Multiobjective Optimization Problem [J].
Schuetze, Oliver ;
Lara, Adriana ;
Coello Coello, Carlos A. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (04) :444-455
[52]  
Schutze O., 2004, THESIS
[53]   A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem [J].
Shang, Ronghua ;
Wang, Yuying ;
Wang, Jia ;
Jiao, Licheng ;
Wang, Shuo ;
Qi, Liping .
INFORMATION SCIENCES, 2014, 277 :609-642
[54]  
Siwel J., 2014, IEEE T EVOLUT COMPUT, V44, P2329
[55]  
Sun J.Q., 2019, CELL MAPPING METHODS
[56]   Chaotic Multi-Objective Particle Swarm Optimization Algorithm Incorporating Clone Immunity [J].
Sun, Ying ;
Gao, Yuelin ;
Shi, Xudong .
MATHEMATICS, 2019, 7 (02)
[57]  
Van Veldhuizen D.A., 1999, P 1999 ACM S APPL CO, P351, DOI DOI 10.1145/298151.298382
[58]  
Vargas Andrés, 2018, Univ. Sci., V23, P333, DOI 10.11144/javeriana.sc23-3.otpc
[59]  
Vargas A, 2018, COMPUT SIST, V22, P331, DOI [10.13053/CyS-22-2-2950, 10.13053/cys-22-2-2950]
[60]   The multi-port berth allocation problem with speed optimization and emission considerations [J].
Venturini, Giada ;
Iris, Cagatay ;
Kontovas, Christos A. ;
Larsen, Allan .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2017, 54 :142-159