Ensemble and Arithmetic Recombination-Based Speciation Differential Evolution for Multimodal Optimization
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Multimodal optimization problems consists of multiple equal or comparable spatially distributed solutions. Niching and clustering differential evolution (DE) techniques have been demonstrated to be highly effective for solving such problems. The key challenge in the speciation niching technique is to balance between local solution exploitation and global exploration. Our proposal enhances exploration by applying arithmetic recombination with speciation and improves exploitation of individual peaks by applying neighborhood mutation with ensemble strategies. Our novel algorithm, called ensemble and arithmetic recombination-based speciation DE, is shown to either outperform or perform comparably to the state-of-the-art algorithms on 29 common multimodal benchmark problems. Comparable performance is observed only when some problems are solved perfectly by the algorithms in the literature.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
Self-citationDifferential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362
Self-citation
Cited by
Recent advances in differential evolution – An updated survey
Das, S., Mullick, S. S., & Suganthan, P. N. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.01.004 · Cited by 1,592
Self-citationDifferential Evolution: A Recent Review Based on State-of-the-Art Works
Ahmad, M. F., Isa, N. A. M., Lim, W. H., & Ang, K. M. (2022) · Alexandria Engineering Journal · doi:10.1016/j.aej.2021.09.013 · Cited by 579
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
Ensemble of differential evolution variants
Wu, G., Shen, X., Li, H., Chen, H., Lin, A., & Suganthan, P. N. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.053 · Cited by 386
Self-citationSeeking 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
Metadata
- Authors
- Hui, S., & Suganthan, P. N.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-01
- Volume
- 46
- Issue
- 1
- Pages
- 64-74
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2047893268
- Cited by
- 118
- References
- 3
- FWCI
- 10.32
- 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.