Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Abstract Recently, more and more multi/many-objective algorithms have been proposed. However, most evolutionary algorithms only focus on solving small-scale multi/many-objective optimization problems, and few researchers pay attention to solving large-scale optimization problems. Like NSGA-III, although it performs well in solving many-objective optimization problems, it does not perform well in large-scale optimization problems. To solve this problem, in this paper, we introduce the information feedback models to improve the ability of NSGA-III to solve large-scale optimization problems. In the feedback models, the historical information of individuals in the previous generations is used in the update process of the current generation. According to the different ways of selecting individual, information feedback models are divided into two categories: one is to select individuals in a fixed way (called M-F) and the other is to select individuals randomly (called M-R). For each type of model, if the number of individuals selected is different, the information feedback models also have some difference. According to the number and mode of individual selection, there are six models in this paper. These six models are respectively embedded into NSGA-III to generate six improving NSGA-III algorithms (these six algorithms are collectively referred to as IFM-NSGAIII). These six algorithms are compared with the original NSGA-III on 9 benchmark problems to search the best information feedback model and the best IFM-NSGAIII algorithm. Then the two best IFM-NSGAIII algorithms are compared with four state-of-the-art algorithms on 9 test functions. Experiments show that the proposed algorithms are highly competitive on test problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
Muiltiobjective 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
Deb, K., Mohan, M., & Mishra, S. (2005) · Evolutionary Computation · doi:10.1162/106365605774666895 · Cited by 637
Metadata
- Authors
- Gu, Z.-M., & Wang, G.-G.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 107
- Pages
- 49-69
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W3004126271
- Cited by
- 184
- References
- 5
- FWCI
- 14.77
- 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.