The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems
Abstract
Many Differential Evolution algorithms are introduced in the literature to solve optimization problems with diverse set of characteristics. In this paper, we propose an extension of the previously published paper LSHADE-EpSin that was ranked as the joint winner in the real-parameter single objective optimization competition, CEC 2016. The contribution of this work constitutes two major modifications that have been added to enhance the performance: ensemble of sinusoidal approaches based on performance adaptation and covariance matrix learning for the crossover operator. Two sinusoidal waves have been used to adapt the scaling factor: non-adaptive sinusoidal decreasing adjustment and an adaptive sinusoidal increasing adjustment. Instead of choosing one of the sinusoidal waves randomly, a performance adaptation scheme based on earlier success is used in this work. Moreover, covariance matrix learning with Euclidean neighborhood is used for the crossover operator to establish a suitable coordinate system, and to enhance the capability of LSHADE-EpSin to tackle problems with high correlation between the variables. The proposed algorithm, namely LSHADE-cnEpSin, is tested on the IEEE CEC2017 problems used in the Special Session and Competitions on Single Objective Bound Constrained Real-Parameter Single Objective Optimization. The results statistically affirm the efficiency of the proposed approach to obtain better results compared to other state-of-the-art 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.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.927706 · Cited by 3,614
Self-citationImproving the search performance of SHADE using linear population size reduction
Tanabe, R., & Fukunaga, A. S. (2014) · 2014 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2014.6900380 · Cited by 1,625
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-citationSuccess-history based parameter adaptation for Differential Evolution
Tanabe, R., & Fukunaga, A. (2013) · 2013 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2013.6557555 · Cited by 1,367
Wang, Y., Li, H.-X., Huang, T., & Li, L. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.01.038 · Cited by 335
Awad, N. H., Ali, M. Z., Suganthan, P. N., & Reynolds, R. G. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744163 · Cited by 292
Self-citationEnhancing the search ability of differential evolution through orthogonal crossover
Wang, Y., Cai, Z., & Zhang, Q. (2012) · Information Sciences · doi:10.1016/j.ins.2011.09.001 · Cited by 246
Cited by
Marine Predators Algorithm: A nature-inspired metaheuristic
Faramarzi, A., Heidarinejad, M., Mirjalili, S., & Gandomi, A. H. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113377 · Cited by 2,412
Dung beetle optimizer: a new meta-heuristic algorithm for global optimization
Xue, J., & Shen, B. (2023) · The Journal of Supercomputing · doi:10.1007/s11227-022-04959-6 · Cited by 1,686
Yang, Y., Chen, H., Heidari, A. A., & Gandomi, A. H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114864 · Cited by 1,062
Differential Evolution: A review of more than two decades of research
Bilal, Pant, M., Zaheer, H., Garcia-Hernandez, L., & Abraham, A. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103479 · Cited by 1,002
Chameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems
Braik, M. S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114685 · Cited by 504
Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems
Fu, Y., Liu, D., Chen, J., & He, L. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10729-y · Cited by 487
A new meta-heuristic optimizer: Pathfinder algorithm
Yapici, H., & Cetinkaya, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.03.012 · Cited by 339
Chaos Game Optimization: a novel metaheuristic algorithm
Talatahari, S., & Azizi, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09867-w · Cited by 338
Zhong, C., Li, G., Meng, Z., Li, H., Yildiz, A. R., & Mirjalili, S. (2025) · Neural Computing and Applications · doi:10.1007/s00521-024-10694-1 · Cited by 332
Electric eel foraging optimization: A new bio-inspired optimizer for engineering applications
Zhao, W., Wang, L., Zhang, Z., Fan, H., Zhang, J., Mirjalili, S., Khodadadi, N., & Cao, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122200 · Cited by 318
Walrus optimizer: A novel nature-inspired metaheuristic algorithm
Han, M., Du, Z., Yuen, K. F., Zhu, H., Li, Y., & Yuan, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122413 · Cited by 315
Enhancing Learning Efficiency of Brain Storm Optimization via Orthogonal Learning Design
Ma, L., Cheng, S., & Shi, Y. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.2963943 · Cited by 307
Atomic orbital search: A novel metaheuristic algorithm
Azizi, M. (2021) · Applied Mathematical Modelling · doi:10.1016/j.apm.2020.12.021 · Cited by 300
Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization
Mohamed, A. W., Hadi, A. A., & Jambi, K. M. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.10.006 · Cited by 266
Zhu, Y., Zhang, M., Huang, Q., Wu, X., Wan, L., & Huang, J. (2025) · Scientific Reports · doi:10.1038/s41598-025-87285-0 · Cited by 42
Metadata
- Authors
- Awad, N. H., Ali, M. Z., & Suganthan, P. N.
- Venue
- 2017 IEEE Congress on Evolutionary Computation (CEC)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 372-379
- OpenAlex
- W2729414995
- Cited by
- 473
- References
- 15
- FWCI
- 9.15
- Type
- conference paper
- 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.