The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Indicator-based Multi-objective Evolutionary Algorithms: A Comprehensive Survey
Abstract
For over 25 years, most multi-objective evolutionary algorithms (MOEAs) have adopted selection criteria based on Pareto dominance. However, the performance of Pareto-based MOEAs quickly degrades when solving multi-objective optimization problems (MOPs) having four or more objective functions (the so-called many-objective optimization problems), mainly because of the loss of selection pressure. Consequently, in recent years, MOEAs have been coupled with indicator-based selection mechanisms in furtherance of increasing the selection pressure so that they can properly solve many-objective optimization problems. Several research efforts have been conducted since 2003 regarding the design of the so-called indicator-based (IB) MOEAs. In this article, we present a comprehensive survey of IB-MOEAs for continuous search spaces since their origins up to the current state-of-the-art approaches. We propose a taxonomy that classifies IB-mechanisms into two main categories: (1) IB-Selection (which is divided into IB-Environmental Selection, IB-Density Estimation, and IB-Archiving) and (2) IB-Mating Selection. Each of these classes is discussed in detail in this article, emphasizing the advantages and drawbacks of the selection mechanisms. In the final part, we provide some possible paths for future research.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
Cited by
A Survey on Evolutionary Constrained Multiobjective Optimization
Liang, J., Ban, X., Yu, K., Qu, B., Qiao, K., Yue, C., Chen, K., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3155533 · Cited by 438
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
A practical guide to multi-objective reinforcement learning and planning
Hayes, C. F., Rădulescu, R., Bargiacchi, E., Källström, J., Macfarlane, M., Reymond, M., Verstraeten, T., Zintgraf, L. M., Dazeley, R., Heintz, F., et al. (2022) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-022-09552-y · Cited by 400
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
Halim, A. H., Ismail, I., & Das, S. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09906-6 · Cited by 293
Pratama, A. R. (2025) · PeerJ Computer Science · doi:10.7717/peerj-cs.2953 · Cited by 22
Metadata
- Authors
- Falcón-Cardona, J. G., & Coello, C. A. C.
- Venue
- ACM Computing Surveys
- Published
- 2020-03-20
- Volume
- 53
- Issue
- 2
- Pages
- 1-35
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W3011855308
- Cited by
- 181
- References
- 3
- FWCI
- 11.20
- 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.