Reducing the computational cost of pareto set approximation

1993 ◽  
Vol 4 (3) ◽  
pp. 304-306
Author(s):  
M. V. Abramova
2018 ◽  
Vol 19 (3) ◽  
pp. 437 ◽  
Author(s):  
Thiago Santos ◽  
S Xavier

The algorithms of multi-objective optimisation had a relative growth in the last years. Thereby, it's 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($\Delta$), Averaged Hausdorff distance ($\Delta_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 tho know  the true Pareto set and 2) Medium computational cost when compared with Hypervolume.


Author(s):  
М.А. Кулаченко ◽  
И.С. Масич

Предлагается способ генерации логических закономерностей через аппроксимацию множества Парето эвристическим алгоритмом NSGA-II. Указанный метод применяется для решения задачи медицинской диагностики. The paper focuses on logical patterns generation as Pareto set approximation using heuristic algorithm NSGA-II. This method is used to solve the problem of medical diagnostics.


2011 ◽  
Vol 6 (4) ◽  
pp. 665-678 ◽  
Author(s):  
Panos M. Pardalos ◽  
Ingrida Steponavičė ◽  
Antanas Z̆ilinskas

2012 ◽  
Author(s):  
Todd Wareham ◽  
Robert Robere ◽  
Iris van Rooij
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document