Skip to content
Conference

The Algorithm Is Not the Answer: A Methodological Review of Metaheuristic Controller Tuning

Aug 2026 · 2026 6th International Conference on Emerging Smart Technologies and Applications (eSmarTA) · pp. 1-9 · 0 citations · 22 references

Abstract

Metaheuristic optimization has become a widely adopted approach for controller parameter tuning in nonlinear, multi-objective engineering systems where classical methods fail. However, the rapid expansion of the literature has not been matched by methodological rigor, raising concerns about reproducibility and practical relevance. This review provides a critical synthesis of studies published between 2025 and 2026, organized thematically around controller architectures, optimizer families, and objective function design. Across five application domains, EV charging, power systems, robotics, process control, and marine systems, we identify persistent gaps: objective functions that disregard engineering priorities, weak constraint handling, unfair benchmarking, poor reproducibility, and insufficient validation. To move the field forward, we offer four prescriptions: benchmark relentlessly, validate physically, attribute honestly, and report completely. We conclude that meaningful progress requires shifting focus from algorithmic novelty to problem-structure-aware, methodologically credible optimization frameworks.

View source

Similar papers

Open access Sep 2026

Comparative Performance Analysis of Nature-Inspired Metaheuristic Algorithms for PID Controller Optimization

Among the evaluated methods, PSO consistently provides the best overall performance by achieving faster convergence and superior solution quality under limited function evaluations, while GWO and WOA exhibit competitive and robust performance across challenging benchmark problems.

Chong-Wen Huang, Hao-Xiang Lei, Cheng-Yi Li et al. · 0 citations
Review Open access Sep 2026

A Systematic Review of Hyper-Heuristics in Power System Optimization: Theory, Applications, and Future Directions

Modern power system optimization problems have become increasingly large-scale, non-convex, and highly constrained. Conventional optimization methods and metaheuristics struggle with these complexities, primarily due to premature convergence, extensive parameter-tuning requirements, and the limitations of the No Free L...

Dimitrios Gonidakis, Paraskevi Zacharia, Ch. Drosos et al. · 0 citations
Open access Aug 2026

Camel foraging optimization algorithm: a mechanism-driven metaheuristic with fractional memory for constrained optimization

Global optimization problems often involve nonlinear, multimodal, non-separable, and constrained search landscapes that challenge population-based metaheuristics under limited function-evaluation budgets. This paper proposes the camel foraging optimization algorithm (CFEOA), a mechanism-driven metaheuristic that comb...

Idriss Dagal, Elif Demir, Alpaslan Demirci et al. · 0 citations
Open access Aug 2026

A general hybrid framework for many-objective optimization: integrating local search into reference-vector-based evolutionary algorithms

Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...

Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al. · 0 citations
Review Open access 2026

Metaheuristic-Based Test Case Selection for Regression Testing: A Systematic Literature Review

Regression testing plays a crucial role in ensuring that software modifications do not adversely affect existing functionality. However, test suites continue to grow, and the retest-all method has become increasingly impractical due to high execution costs and time constraints. Consequently, Test Case Selection (TCS) h...

Siti Hawa Mohamed Shareef, Rabatul Aduni Sulaiman, Nazri M. Nawi et al. · 0 citations
Preprint Sep 2026

Single-Loop Gradient Algorithms for Pessimistic Bilevel Optimization Problems

This work proposes a smooth approximation of PBO through reformulation, penalization and regularization, and establishes convergence guarantees in terms of both minimizers and stationarity, and develops two single-loop algorithms for deterministic and stochastic PBOs, respectively.

Qi Cao, Bo Zeng, Shang-Zhi Zeng et al. · 0 citations

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