The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Dual-Strategy Differential Evolution With Affinity Propagation Clustering for Multimodal Optimization Problems
Open accessAbstract
Multimodal optimization problem (MMOP), which targets at searching for multiple optimal solutions simultaneously, is one of the most challenging problems for optimization. There are two general goals for solving MMOPs. One is to maintain population diversity so as to locate global optima as many as possible, while the other is to increase the accuracy of the solutions found. To achieve these two goals, a novel dual-strategy differential evolution (DSDE) with affinity propagation clustering (APC) is proposed in this paper. The novelties and advantages of DSDE include the following three aspects. First, a dual-strategy mutation scheme is designed to balance exploration and exploitation in generating offspring. Second, an adaptive selection mechanism based on APC is proposed to choose diverse individuals from different optimal regions for locating as many peaks as possible. Third, an archive technique is applied to detect and protect stagnated and converged individuals. These individuals are stored in the archive to preserve the found promising solutions and are reinitialized for exploring more new areas. The experimental results show that the proposed DSDE algorithm is better than or at least comparable to the state-of-the-art multimodal algorithms when evaluated on the benchmark problems from CEC2013, in terms of locating more global optima, obtaining higher accuracy solution, and converging with faster speed.
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
Ant Colony Optimization for Mixed-Variable Optimization Problems
Liao, T., Socha, K., Montes de Oca, M. A., Stutzle, T., & Dorigo, M. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281531 · Cited by 270
Cited by
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Self-citationCao, Y., Zhang, H., Li, W., Zhou, M., Zhang, Y., & Chaovalitwongse, W. A. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2885075 · Cited by 405
Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
Chen, Z.-G., Zhan, Z.-H., Lin, Y., Gong, Y.-J., Gu, T.-L., Zhao, F., Yuan, H.-Q., Chen, X., Li, Q., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2832640 · Cited by 278
Self-citationWang, Z.-J., Zhan, Z.-H., Yu, W.-J., Lin, Y., Zhang, J., Gu, T.-L., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2933499 · Cited by 257
Self-citation
Metadata
- Authors
- Wang, Z.-J., Zhan, Z.-H., Lin, Y., Yu, W.-J., Yuan, H.-Q., Gu, T.-L., Kwong, S., & Zhang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-12
- Volume
- 22
- Issue
- 6
- Pages
- 894-908
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2769293273
- Cited by
- 177
- References
- 1
- FWCI
- 9.51
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Dual-Strategy Differential Evolution With Affinity Propagation Clustering for Multimodal Optimization Problems. https://app.cochat.ai/papers/10.1109/tevc.2017.2769108
- The paper
- Wang, Z.-J., Zhan, Z.-H., Lin, Y., Yu, W.-J., Yuan, H.-Q., Gu, T.-L., Kwong, S., & Zhang, J. (2018). Dual-Strategy Differential Evolution With Affinity Propagation Clustering for Multimodal Optimization Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2769108
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.