The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Performance assessment of multiobjective optimizers: an analysis and review
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 set, 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 also considered. 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 one to classify and discuss existing techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Self-citationMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Self-citationA Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Multiobjective optimization using evolutionary algorithms — A comparative case study
Zitzler, E., & Thiele, L. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056872 · Cited by 2,262
Self-citationEvolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Self-citationCombining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
Self-citationMultiobjective evolutionary algorithms: classifications, analyses, and new innovations
Lamont, G. B., & Veldhuizen, D. A. V. (1999) · Cited by 1,212
Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization.
Schott, J. R. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,015
Czyzżak, P., & Jaszkiewicz, A. (1998) · Journal of Multi‐Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199801)7:1<34::aid-mcda161>3.0.co;2-6 · Cited by 793
An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
Zitzler, E., & Thiele, L. (1998) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-004288833 · Cited by 689
Self-citationOn metrics for comparing nondominated sets
Knowles, J., & Corne, D. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007013 · Cited by 560
On measuring multiobjective evolutionary algorithm performance
Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870296 · Cited by 512
MOSA method: a tool for solving multiobjective combinatorial optimization problems
Ulungu, E. L., Teghem, J., Fortemps, P. H., & Tuyttens, D. (1999) · Journal of Multi-Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199907)8:4<221::aid-mcda247>3.0.co;2-o · Cited by 385
On the performance assessment and comparison of stochastic multiobjective optimizers
Fonseca, C. M., & Fleming, P. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1022 · Cited by 378
Self-citationEvaluating the quality of approximations to the non-dominated set
Hansen, M. P., & Jaszkiewicz, A. (1998) · Cited by 301
Metrics for Quality Assessment of a Multiobjective Design Optimization Solution Set
Wu, J., & Azarm, S. (2001) · Journal of Mechanical Design · doi:10.1115/1.1329875 · Cited by 274
Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function
da Fonseca, V. G., Fonseca, C. M., & Hall, A. O. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_15 · Cited by 204
Self-citationEvolutionary algorithms for multi-objective optimization: performance assessments and comparisons
Tan, K. C., Lee, T. H., & Khor, E. F. (2002) · Congress on Evolutionary Computation · doi:10.1109/cec.2001.934296 · Cited by 86
Cited by
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Indicator-Based Selection in Multiobjective Search
Zitzler, E., & Künzli, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_84 · Cited by 2,259
Self-citation
Metadata
- Authors
- Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2003-04
- Volume
- 7
- Issue
- 2
- Pages
- 117-132
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2098907614
- Cited by
- 4,330
- References
- 22
- FWCI
- 63.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.