A Convergence Indicator for Multi-Objective Optimisation Algorithms
多目标优化算法的收敛指标
ABSTRACT
摘要
The algorithms of multi-objective optimisation had a relative growth in the last years. Thereby, it requires some way of comparing the results of these. In this sense, performance measures play a key role. In general, it’s considered some properties of these algorithms such as capacity, convergence, diversity or convergence-diversity. There are some known measures such as generational distance (GD), inverted generational distance (IGD), hypervolume (HV), Spread (∆), Averaged Hausdorff distance (∆p ), R2-indicator, among others. In this paper, we focuses on proposing a new indicator to measure convergence based on the traditional formula for Shannon entropy. The main features about this measure are: 1) It does not require to know the true Pareto set and 2) Medium computational cost when compared with Hypervolume.
多目标优化算法在过去几年中相对增长。因此,它需要某种方法来比较这些结果。从这个意义上说,绩效衡量起着关键作用。通常,它被认为是这些算法的某些属性,例如容量、收敛性、多样性或收敛多样性。有一些已知的测量值,例如代际距离 (GD)、倒置代际距离 (IGD)、超容量 (HV)、传播 (∆)、平均豪斯多夫距离 (∆ p )、R2 指标等。
在本文中,我们重点提出了一个基于香农熵传统公式的新指标来衡量收敛性。该度量的主要特点是:1)它不需要知道真正的帕累托集,2)与超容量相比,计算成本中等。
Keywords:
关键字:
Shannon Entropy; Performance Measure; Multi-Objective Optimisation Algorithms
香农熵;性能测量;多目标优化算法
https://www.scielo.br/j/tema/a/fyPgdLmf3MDWpHDpymYJmjS/
1 INTRODUCTION
1 引言
Nowadays, the evolutionary algorithms (EAs) are used to obtain