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
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.
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
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
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Mirjalili, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.07.006 · Cited by 4,626
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Firefly Algorithms for Multimodal Optimization
Yang, X.-S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04944-6_14 · Cited by 4,075
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
Particle swarm optimization (PSO). A tutorial
Marini, F., & Walczak, B. (2015) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2015.08.020 · Cited by 1,828
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2012) · Information Sciences · doi:10.1016/j.ins.2011.08.006 · Cited by 1,792
A comprehensive review of firefly algorithms
Fister, I., Fister, I., Yang, X.-S., & Brest, J. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.06.001 · Cited by 1,308
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Metaheuristics—the metaphor exposed
Sörensen, K. (2015) · International Transactions in Operational Research · doi:10.1111/itor.12001 · Cited by 1,051
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Firefly algorithm: recent advances and applications
Yang, X. S., & He, X. (2013) · International Journal of Swarm Intelligence · doi:10.1504/ijsi.2013.055801 · Cited by 858
Firefly Algorithm: Recent Advances and ApplicationsPreprint
Yang, X.-S., & He, X. (2013) · Cited by 708
The CMA Evolution Strategy: A Tutorial
Nikolaus Hansen, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.00772 · Cited by 622
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
The CMA Evolution Strategy: A TutorialPreprint
Hansen, N. (2005) · arXiv (Cornell University) · Cited by 580
A swarm optimization algorithm inspired in the behavior of the social-spider
Cuevas, E., Cienfuegos, M., Zaldívar, D., & Pérez-Cisneros, M. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.041 · Cited by 573
Self-citationCarrasco, J., García, S., Rueda, M. M., Das, S., & Herrera, F. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100665 · Cited by 513
2015 IEEE Symposium Series on Computational Intelligence
(2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2479518 · Cited by 443
Simple random search provides a competitive approach to reinforcement learningPreprint
Mania, H., Guy, A., & Recht, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07055 · Cited by 350
The (black) art of runtime evaluation: Are we comparing algorithms or implementations?
Kriegel, H.-P., Schubert, E., & Zimek, A. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-016-1004-2 · Cited by 229
From ants to whales: metaheuristics for all tastes
Fausto, F., Reyna-Orta, A., Cuevas, E., Andrade, Á. G., & Perez-Cisneros, M. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-018-09676-2 · Cited by 195
Self-citationMetaheuristic Algorithms: Optimal Balance of Intensification and Diversification
Yang, X., Deb, S., & Fong, S. J. (2014) · Applied Mathematics & Information Sciences · doi:10.12785/amis/080306 · Cited by 181
Bastien Chopard, B., & Tomassini, M. (2018) · Natural computing series · doi:10.1007/978-981-95-6216-9_7 · Cited by 94
Elitism and Distance Strategy for Selection of Evolutionary Algorithms
Du, H., Wang, Z., Zhan, W., & Guo, J. (2018) · IEEE Access · doi:10.1109/access.2018.2861760 · Cited by 71
Swarm-Based Metaheuristic Algorithms and No-Free-Lunch Theorems
Yang, X. (2012) · InTech eBooks · doi:10.5772/30852 · Cited by 65
Attraction and diffusion in nature-inspired optimization algorithms
Yang, X., Deb, S., Hanne, T., & He, X. (2015) · Neural Computing and Applications · doi:10.1007/s00521-015-1925-9 · Cited by 39
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
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.