Skip to content
Review Open access

A Systematic Review of Stopping Criteria in Metaheuristic Optimization Algorithms

Sep 2026 · Symposium on Intelligent Systems and Informatics · pp. 033-040 · 0 citations · 59 references

TL;DR

This paper proposes a taxonomy of stopping criteria based on the aspect of the metaheuristic search process used to trigger algorithm termination, covering resource-based, objective-progress-based, population-state-based, convergence-indicator-based, statistical, algorithm-specific, and hybrid approaches.

Abstract

Metaheuristic optimization algorithms are widely applied in complex optimization problems due to their flexibility and ability to provide almost optimal solutions in large search spaces. One of the key challenges in these algorithms is determining an appropriate stopping criterion. Too early termination may lead to suboptimal results, while excessive execution increases computational overhead without significant improvement. This paper presents a PRISMA-based literature review of stopping criteria used in metaheuristic optimization algorithms. Following a systematic screening process, 54 primary studies were included in the final qualitative synthesis. Based on the analysis of the selected studies, we propose a taxonomy of stopping criteria based on the aspect of the metaheuristic search process used to trigger algorithm termination, covering resource-based, objective-progress-based, population-state-based, convergence-indicator-based, statistical, algorithm-specific, and hybrid approaches. The review further discusses their applicability across different metaheuristic families, identifies current research trends, and also discusses remaining research gaps.

Read PDF

Similar papers

Review Open access Oct 2026

Tool Path Optimization A Systematic Literature Review On Metaheuristic Algorithms

This study aims to systematically review the post-2021 literature on tool path optimization for multi-hole drilling processes, focusing on the metaheuristic algorithms most frequently applied to this combinatorial problem — namely Ant Colony Optimization (ACO), the Bees Algorithm, the Genetic Algorithm (GA), and the Gr...

Necat Ozan Gençay, Y. Demirel, Kürşat Tanrıver et al. · 0 citations
Review Open access Oct 2026

The Evolution of Metaheuristic Optimization Algorithms: Structures, Inspirations, and Research Trends

This systematic review presents a comprehensive analysis of metaheuristic optimization algorithms based on 515 distinct metaheuristic optimization algorithms and analyzes the historical evolution, inspiration diversity, search structures, symmetry-oriented search balance, and development trends of modern metaheuristics...

Ebubekir Kaya, Harun Akbulut, Ceren Baştemur Kaya et al. · 0 citations
Review Oct 2026

Metaheuristic Approaches for the Satisfiability Problem (SAT): A Systematic Review and Comparative Study with Modern SAT Solvers

The Boolean Satisfiability Problem is a central challenge in artificial intelligence and combinatorial optimization, with applications in circuit verification, planning, and bioinformatics. This study makes two main contributions: a systematic review of metaheuristic approaches conducted under the Preferred Reporting I...

Fatima Mellouk, Bouchra Karoum, I. Hafidi · 0 citations
Review Open access 2026

Metaheuristic Approaches for Test Redundancy Reduction: A Systematic Review of Algorithms, Optimization Strategies, and Research Trends

Test redundancy reduction (TRR) addresses the continued growth of regression test suites by selecting a smaller test set while preserving required testing adequacy. This updated systematic review maps metaheuristic approaches to TRR and closely related test-suite reduction/minimization across algorithm family, search a...

Norasyikin Safieny, K. Z. Zamli, H. L. Zakaria et al. · 0 citations
Sep 2026

A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits

STILO is introduced, a MOF specifically designed for optimization under strict time limits that integrates fine-grained configuration spaces for ant colony optimization, genetic algorithm, and simulated annealing, combining existing and novel operators.

Umut Çalıkyılmaz, Nitin Nayak, S. Groppe · 0 citations
Review Open access 2026

Algorithms for Solving the Set Coverage Problem

The main focus is on algorithms using metaheuristics, there are population-based metaheuristics and single-data-based metaheuristics.

P. I. Vaskin, A. A. Liss · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.