The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Multimodal Multiobjective Evolutionary Optimization With Dual Clustering in Decision and Objective Spaces
Abstract
This article suggests a multimodal multiobjective evolutionary algorithm with dual clustering in decision and objective spaces. One clustering is run in decision space to gather nearby solutions, which will classify solutions into multiple local clusters. Nondominated solutions within each local cluster are first selected to maintain local Pareto sets, and the remaining ones with good convergence in objective space are also selected, which will form a temporary population with more than${N}$solutions (${N}$is the population size). After that, a second clustering is run in objective space for this temporary population to get${N}$final clusters with good diversity in objective space. Finally, a pruning process is repeatedly run on the above clusters until each cluster has only one solution, which removes the most crowded solution in decision space from the most crowded cluster in objective space each time. This way, the clustering in decision space can distinguish all Pareto sets and avoid the loss of local Pareto sets, while that in objective space can maintain diversity in objective space. When solving all the benchmark problems from the competition of multimodal multiobjective optimization in the IEEE Congress on Evolutionary Computation 2019, the experiments validate our advantages to maintain diversity in both objective and decision spaces.
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
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
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785 · cited 1×
“Moreover, to quantify the overall performance of each algorithm, their performance ranks obtained from Friedman’s test [58] on all the test problems are illustrated by boxplots in Fig.”
Method
Cited by
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Liang, J., Li, Z.-W., Yue, C.-T., Hu, Z., Cheng, H., Liu, Z.-X., & Guo, W.-F. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac254 · Cited by 23
Metadata
- Authors
- Lin, Q., Lin, W., Zhu, Z., Gong, M., Li, J., & Coello, C. A. C.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2021-02
- Volume
- 25
- Issue
- 1
- Pages
- 130-144
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3043065261
- Cited by
- 206
- References
- 3
- FWCI
- 9.89
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multimodal Multiobjective Evolutionary Optimization With Dual Clustering in Decision and Objective Spaces. https://app.cochat.ai/papers/10.1109/tevc.2020.3008822
- The paper
- Lin, Q., Lin, W., Zhu, Z., Gong, M., Li, J., & Coello, C. A. C. (2021). Multimodal Multiobjective Evolutionary Optimization With Dual Clustering in Decision and Objective Spaces. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2020.3008822
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.