The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Multimodal Estimation of Distribution Algorithms
Open accessAbstract
Taking the advantage of estimation of distribution algorithms (EDAs) in preserving high diversity, this paper proposes a multimodal EDA. Integrated with clustering strategies for crowding and speciation, two versions of this algorithm are developed, which operate at the niche level. Then these two algorithms are equipped with three distinctive techniques: 1) a dynamic cluster sizing strategy; 2) an alternative utilization of Gaussian and Cauchy distributions to generate offspring; and 3) an adaptive local search. The dynamic cluster sizing affords a potential balance between exploration and exploitation and reduces the sensitivity to the cluster size in the niching methods. Taking advantages of Gaussian and Cauchy distributions, we generate the offspring at the niche level through alternatively using these two distributions. Such utilization can also potentially offer a balance between exploration and exploitation. Further, solution accuracy is enhanced through a new local search scheme probabilistically conducted around seeds of niches with probabilities determined self-adaptively according to fitness values of these seeds. Extensive experiments conducted on 20 benchmark multimodal problems confirm that both algorithms can achieve competitive performance compared with several state-of-the-art multimodal algorithms, which is supported by nonparametric tests. Especially, the proposed algorithms are very promising for complex problems with many local optima.
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
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
An introduction and survey of estimation of distribution algorithms
Hauschild, M., & Pelikan, M. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.08.003 · Cited by 478
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
Seeking Multiple Solutions: An Updated Survey on Niching Methods and Their Applications
Li, X., Epitropakis, M. G., Deb, K., & Engelbrecht, A. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2638437 · Cited by 339
A Level-Based Learning Swarm Optimizer for Large-Scale Optimization
Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2743016 · Cited by 326
Self-citationAdaptive Multimodal Continuous Ant Colony Optimization
Yang, Q., Chen, W.-N., Yu, Z., Gu, T., Li, Y., Zhang, H., & Zhang, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2591064 · Cited by 325
Self-citation
Metadata
- Authors
- Yang, Q., Chen, W.-N., Li, Y., Chen, C. L. P., Xu, X.-M., & Zhang, J.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-03
- Volume
- 47
- Issue
- 3
- Pages
- 636-650
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2285034650
- Cited by
- 214
- References
- 2
- FWCI
- 16.32
- Type
- journal article
- Language
- en
- Open access
- green
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 Estimation of Distribution Algorithms. https://app.cochat.ai/papers/10.1109/tcyb.2016.2523000
- The paper
- Yang, Q., Chen, W.-N., Li, Y., Chen, C. L. P., Xu, X.-M., & Zhang, J. (2017). Multimodal Estimation of Distribution Algorithms. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2523000
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.