Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 28 min ago
Peer-reviewedCC BY 4.0Mathematics

Newly Proposed Metaheuristic Optimization Algorithms: A Systematic Review of Recent Trends, Validation Practices, and Applications

  1. 1Departamento de Ciencias Computacionales, Centro Universitario de Ciencias Exactas e Ingenierías, Universidad de Guadalajara, Guadalajara C.P. 44430, Jalisco, Mexico
  2. 2Centro de Enseñanza Técnica Industrial, Plantel Colomos, Desarrollo de Software, Guadalajara C.P. 44638, Jalisco, Mexico

Abstract

The proliferation of metaheuristic optimization algorithms raises questions about methodological novelty, validation, reproducibility, and practical applicability. This systematic review characterizes English-language journal articles introducing new metaheuristics, published from January 2020 to 4 July 2026 and retrieved through the Scopus title query TITLE (novel AND metaheuristic AND algorithm). The analysis examines publication trends, algorithmic characteristics, reported validation practices, implementation resources, and applications. Among complete publication years (2020–2025), annual counts increased overall, with fluctuations, and peaked in 2025. Human-based, bio-inspired, and swarm-intelligence approaches predominate, although their relative representation is sensitive to venue composition. Continuous, single-objective, population-based methods with uniform random initialization are prevalent; these broad descriptors do not establish similarity between search operators or underlying mechanisms. Evaluation relies heavily on conventional benchmarks, recurrent CEC suites, and a limited set of engineering problems. Statistical procedures and code availability vary across studies; their reported presence does not establish methodological rigor or computational reproducibility. Problems recorded under the domain-specific category were less frequently identified than benchmark functions; this category includes application-derived benchmarks. Analyses excluding the dominant journal and stratifying by journal quartile characterize variation associated with venue composition. The corpus combines taxonomic diversity with recurrent optimization settings and evaluation practices, highlighting opportunities for clearer methodological differentiation, transparent experimental protocols, accessible implementations, and broader application-oriented evaluation. These findings describe publications retrieved by the specified search strategy and may not generalize to newly proposed metaheuristics as a whole.

Related

  1. Soft Computing Optimization of Industrial Robot Inverse Kinematics for Intelligent Manufacturing: A Statistical Benchmark of Metaheuristic Algorithms
    Julio Antonio Caballero-Mora, Daniel Sanin-Villa, Victoria Bello-Hernández +3
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. Parallel Optimization: Theory, Algorithms, and Applications,
    Yair Censor, Stavros A. Zenios
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  3. Performance Evaluation of Metaheuristic Algorithms for Fractional-Order PID Controller Tuning in Non-Linear Systems
    Basil Mohammed Al-Hadithi, Adrián Gómez García, Manuel Barraza-Rodríguez
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. Large-Scale Comparison of Metaheuristic Algorithms via Behavioral Verification of Large Language Model-Generated Codes
    Emad Alharbi
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. Energy-Efficient UAV Covert Communications via Metaheuristic Optimization
    Nguyen Minh Quan, Tran Thanh Thu, Nguyen The Ngoc Khue +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@article{rodriguezvazquez2026newly,
  title = {{Newly Proposed Metaheuristic Optimization Algorithms: A Systematic Review of Recent Trends, Validation Practices, and Applications}},
  author = {Alma-Nayeli Rodríguez-Vázquez},
  journal = {Mathematics},
  year = {2026},
  month = nov,
  doi = {10.3390/math14214112},
  url = {https://www.mdpi.com/2227-7390/14/21/4112},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Newly Proposed Metaheuristic Optimization Algorithms: A Systematic Review of Recent Trends, Validation Practices, and Applications
AU  - Alma-Nayeli Rodríguez-Vázquez
PY  - 2026
DA  - 2026/11/09
JO  - Mathematics
DO  - 10.3390/math14214112
UR  - https://www.mdpi.com/2227-7390/14/21/4112
AB  - The proliferation of metaheuristic optimization algorithms raises questions about methodological novelty, validation, reproducibility, and practical applicability. This systematic review characterizes English-language journal articles introducing new metaheuristics, published from January 2020 to 4 July 2026 and retrieved through the Scopus title query TITLE (novel AND metaheuristic AND algorithm). The analysis examines publication trends, algorithmic characteristics, reported validation practices, implementation resources, and applications. Among complete publication years (2020–2025), annual counts increased overall, with fluctuations, and peaked in 2025. Human-based, bio-inspired, and swarm-intelligence approaches predominate, although their relative representation is sensitive to venue composition. Continuous, single-objective, population-based methods with uniform random initialization are prevalent; these broad descriptors do not establish similarity between search operators or underlying mechanisms. Evaluation relies heavily on conventional benchmarks, recurrent CEC suites, and a limited set of engineering problems. Statistical procedures and code availability vary across studies; their reported presence does not establish methodological rigor or computational reproducibility. Problems recorded under the domain-specific category were less frequently identified than benchmark functions; this category includes application-derived benchmarks. Analyses excluding the dominant journal and stratifying by journal quartile characterize variation associated with venue composition. The corpus combines taxonomic diversity with recurrent optimization settings and evaluation practices, highlighting opportunities for clearer methodological differentiation, transparent experimental protocols, accessible implementations, and broader application-oriented evaluation. These findings describe publications retrieved by the specified search strategy and may not generalize to newly proposed metaheuristics as a whole.
SN  - 2227-7390
ER  -