Name
Abstract | ||
|---|---|---|
The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced. Here, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-31153-1_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Multi-objective optimization,Averaged hausdorff distance,Convex front,Optimal archives | Applied mathematics,Approximations of π,Continuous variable,Multi-objective optimization,Regular polygon,Hausdorff distance,Optimization algorithm,Hausdorff space,Mathematics | Conference |
Volume | ISSN | Citations |
9598 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Günter Rudolph | 1 | 219 | 48.59 |
| Oliver Schütze | 2 | 492 | 35.88 |
| Heike Trautmann | 3 | 623 | 43.22 |