Performance assessment of multiobjective optimizers: an analysis and review (2003) [33 citations — 2 self]
Abstract:
An important issue in multiobjective optimization is the quantitative comparison of the performance of different algorithms. In the case of multiobjective evolutionary algorithms, the outcome is usually an approximation of the Pareto-optimal front, which is denoted as an approximation set, and therefore the question arises of how to evaluate the quality of approximation sets. Most popular are methods that assign each approximation set a vector of real numbers that reflect different aspects of the quality. Sometimes, pairs of approximation sets are considered too. In this study, we provide a rigorous analysis of the limitations underlying this type of quality assessment. To this end, a mathematical framework is developed which allows to classify and discuss existing techniques. 1
Citations
| 462 | Multi-objective optimization using evolutionary algorithms – Deb - 2001 |
| 208 | A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II – Pratab, Deb, et al. - 2000 |
| 66 | On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers – Fonseca, Fleming - 1996 |
| 17 | Inferential performance assessment of stochastic optimisers and the attainment function – Fonseca, Fonseca, et al. |
| 16 | Design Space Exploration Using the Genetic Algorithm – Esbensen, Kuh - 1996 |
| 10 | Approximating multi-objective knapsack problems – Erlebach, Kellerer, et al. - 2001 |
| 6 | Pareto-simulated annealing—a meta-heuristic technique for multi-objective combinatorial optimization – Czyzak, Jaszkiewicz - 1998 |
| 2 | Heuristic estimation of the efficient frontier for a bi-criteria scheduling problem. Decision Sciences – De, Ghosh, et al. - 1992 |
