The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Performance assessment and exhaustive listing of 500+ nature-inspired metaheuristic algorithms
Open accessAbstract
Metaheuristics are popularly used in various fields, and they have attracted much attention in the scientific and industrial communities. In recent years, the number of new metaheuristic names has been continuously growing. Generally, the inventors attribute the novelties of these new algorithms to inspirations from either biology, human behaviors, physics, or other phenomena. In addition, these new algorithms, compared against basic versions of other metaheuristics using classical benchmark problems, show competitive performances. However, many new metaheuristics are not rigorously tested on challenging benchmark suites and are not compared with state-of-the-art metaheuristic variants. Therefore, in this study, we exhaustively tabulate more than 500 metaheuristics. In particular, several representative metaheuristics are introduced from two aspects, namely, the inspirational source and the essential operators for generating solutions. To comparatively evaluate the performance of the state-of-the-art and newly proposed metaheuristics, 11 newly proposed metaheuristics (generally with high numbers of citations) and 4 state-of-the-art metaheuristics are comprehensively compared on the CEC2017 benchmark suite. For fair comparisons, a parameter tuning tool named irace is used to automatically configure the parameters of all 15 algorithms. In addition, whether these algorithms have a search bias to the origin (i.e., the center of the search space) is investigated. All the experimental results are analyzed by several nonparametric statistical methods, including the Bayesian rank-sum test, Friedman test, Wilcoxon signed-rank test, critical difference plot and Bayesian signed-rank test. Moreover, the convergence, diversity, and the trade-off between exploration and exploitation of these 15 algorithms are also analyzed. The results show that the performance of the newly proposed EBCM algorithm performs similarly to the 4 compared algorithms and has the same properties and behaviors, such as convergence, diversity, exploration and exploitation trade-offs, in many aspects. However, the other 10 recent metaheuristics are less efficient and robust than the 4 state-of-the-art metaheuristics. The performance of all 15 of the algorithms is likely to deteriorate due to certain transformations, while the 4 state-of-the-art metaheuristics are less affected by transformations such as the shifting of the global optimal point away from the center of the search space. It should be noted that, except EBCM, the other 10 new algorithms are inferior to the 4 state-of-the-art algorithms in terms of convergence speed and global search ability on CEC 2017 functions. Moreover, the other 10 new algorithms are rougher (i.e., present in their behavior with high oscillations) in terms of the trade-off between exploitation and exploration and population diversity compared with the 4 state-of-the-art algorithms. Finally, several important issues relevant to the metaheuristic research area are discussed and some potential research directions are suggested.
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
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-citationThe irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
Differential evolution with multi-population based ensemble of mutation strategies
Wu, G., Mallipeddi, R., Suganthan, P. N., Wang, R., & Chen, H. (2016) · Information Sciences · doi:10.1016/j.ins.2015.09.009 · Cited by 569
Self-citationEnsemble 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-citation
Cited by
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
Metadata
- Authors
- Ma, Z., Wu, G., Suganthan, P. N., Song, A., & Luo, Q.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2023-03
- Volume
- 77
- Pages
- 101248
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W4316113584
- Cited by
- 207
- References
- 5
- FWCI
- 18.18
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Performance assessment and exhaustive listing of 500+ nature-inspired metaheuristic algorithms. https://app.cochat.ai/papers/10.1016/j.swevo.2023.101248
- The paper
- Ma, Z., Wu, G., Suganthan, P. N., Song, A., & Luo, Q. (2023). Performance assessment and exhaustive listing of 500+ nature-inspired metaheuristic algorithms. Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2023.101248
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.