The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
A better balance in metaheuristic algorithms: Does it exist?
Abstract
Abstract The constant development of new metaheuristic algorithms has led to a saturation in the field of stochastic search. There are now hundreds of different algorithms that can be used to solve any problem. To produce a good performance, every metaheuristic method needs to address a satisfactory equilibrium between exploration and exploitation of the search space. Although exploration and exploitation represent two fundamental concepts in metaheuristics, the main questions about their combination and balance have not been yet completely understood. Most of the existent analyzes conducted on metaheuristic techniques consider only the comparison of their final results which cannot evaluate the nature of a good or bad balance. This paper presents an experimental analysis that quantitatively evaluates the balance between exploration and exploitation of several of the most important and better-known metaheuristic algorithms. In the study, a dimension-wise diversity measurement is used to assess the balance of each scheme considering a representative set of 42 benchmark problems that involve multimodal, unimodal, composite and shifted functions. As a result, the analysis provides several observations that allow understanding how this balance affects the results in each type of functions, and which balance is producing better solutions.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
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
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
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
Cited by
Braik, M., Hammouri, A., Atwan, J., Al-Betar, M. A., & Awadallah, M. A. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108457 · Cited by 742
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
Zamani, H., Nadimi-Shahraki, M. H., & Gandomi, A. H. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.114616 · Cited by 287
Metadata
- Authors
- Morales-Castañeda, B., Zaldívar, D., Cuevas, E., Fausto, F., & Rodríguez, A.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2020-05
- Volume
- 54
- Pages
- 100671
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W3009979760
- Cited by
- 436
- References
- 37
- FWCI
- 16.57
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A better balance in metaheuristic algorithms: Does it exist? https://app.cochat.ai/papers/10.1016/j.swevo.2020.100671
- The paper
- Morales-Castañeda, B., Zaldívar, D., Cuevas, E., Fausto, F., & Rodríguez, A. (2020). A better balance in metaheuristic algorithms: Does it exist? Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2020.100671
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.