Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 176

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A clustering-based differential evolution algorithm for solving multimodal multi-objective optimization problems

Liang, Jing, Qiao, Kangjia, Yue, Caitong, Yu, Kunjie, Qu, Boyang, Xu, Ruohao, Li, Zhimeng, Hu, Yi · 2021 · Swarm and Evolutionary Computation

Abstract

Abstract Multimodal Multi-objective Optimization Problems (MMOPs) refer to the problems that have multiple Pareto-optimal solution sets in decision space corresponding to the same or similar Pareto-optimal front in objective space. These problems require the optimization algorithm to locate multiple Pareto Sets (PSs). This paper proposes a differential evolution algorithm based on the clustering technique and an elite selection mechanism to solve MMOPs. In this algorithm, a Clustering-based Special Crowding Distance (CSCD) method is designed to calculate the comprehensive crowding degree in decision and objective spaces. Subsequently, a distance-based elite selection mechanism (DBESM) is introduced to determine the learning exemplars of various individuals. New individuals are generated around the exemplars to obtain a well-distributed population in both decision and objective spaces. To test the performance of the proposed algorithm, extensive experiments on the suit of CEC'2019 benchmark functions have been conducted. The results indicate that the proposed method has superior performance compared with other commonly used algorithms.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.swevo.2020.100788

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 176

Metadata

Authors
Liang, J., Qiao, K., Yue, C., Yu, K., Qu, B., Xu, R., Li, Z., & Hu, Y.
Venue
Swarm and Evolutionary Computation
Publisher
Elsevier BV
Published
2021-02
Volume
60
Pages
100788
ISSN
2210-6502 (ISSN-L)
OpenAlex
W3094311502
Cited by
176
References
1
FWCI
8.46
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.