Jul 2026· The eurasia proceedings of science, technology, engineering & mathematics· Vol 40, pp. 232-244· 0 citations· 7 references
TL;DR
Overall, the evidence indicates that GWO is the most efficient choice for edge deployment on Raspberry Pi 5, striking a favorable balance between convergence speed, stability, and resource usage.
Abstract
This study investigates the efficiency of five metaheuristic algorithms, namely Differential Evolution (DE), Genetic Algorithm (GA), Grey Wolf Optimizer (GWO), Harmony Search (HS), and Particle Swarm Optimization (PSO), when deployed on a Raspberry Pi 5 edge device. The evaluation focuses on both optimization quality and computational cost, using four standard benchmark functions that represent a range of landscape characteristics: Sphere, Rosenbrock, Rastrigin, and Ackley. Each function is tested at dimensions 10, 30, and 50 to probe scalability. In addition to objective values, the experiments collect per-iteration processor usage and memory (RAM) to provide a practical view of runtime overhead under constrained resources. Among the five candidates, GWO consistently delivers the fastest or near-fastest convergence while keeping variability tight. Its trajectories show smooth descent across functions and dimensions, paired with comparatively modest CPU and RAM footprints. PSO typically ranks second in speed with stable dynamics, though brief CPU spikes often appear at early iterations as swarms synchronize. DE demonstrates resilience on rugged functions but generally requires more iterations to close the final gap. GA and HS can reach competitive objective values on some settings, yet they display wider dispersion and higher overhead at larger dimensions, which reduces their suitability for small devices. Overall, the evidence indicates that GWO is the most efficient choice for edge deployment on Raspberry Pi 5, striking a favorable balance between convergence speed, stability, and resource usage. PSO is a strong alternative when slightly higher processor activity is acceptable. These findings support the adoption of lightweight, variance-stable metaheuristics for edge optimization workloads where CPU and memory budgets are tight.
Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four p...
Gözde Alp, Fatih Soygazi, Yılmaz Kılıçaslan· Mathematics· 0 citations
Comprehensive experiments on numerical benchmarks and neuroevolution robotic control tasks demonstrate that AutoPSO consistently discovers novel PSO variants that significantly outperform strong baselines and confirm that AutoPSO achieves increasing performance gains with larger swarm sizes.
Xin-Meng Yu, Jia-Xin Gao, Jianguo Zhang et al.· IEEE Transactions on Evoluti...· 1 citation
Applied to five engineering optimization problems, modified momentum–leader–differential grey wolf optimizer consistently achieves the lowest objective values, while analytically proving its ability to navigate heavily penalized boundaries and satisfy all constraints.
Xin Su, Yichen Liu· Cluster Computing· 0 citations
This paper introduces the bi-objective problem class CLIMB and analyzes the runtime of GSEMO and the widely used NSGA-II on this problem, and proves that GSEMO and NSGA-II-DYN, a version of NSGA-II with dynamic population sizes, can find the Pareto front of CLIMB in expected fitness evaluations.
An overview of the conceptual review of Hybrid Salp Swarm–Genetic Algorithm optimization in Multidimensional Knapsack Problem outlines the development of the MKP, metaheuristic optimization, evolutionary computation, swarm intelligence and hybrid optimization and discusses the complementary nature of exploring/exploiti...
Asaju La’aro Bolaji, Sanfo Bala, Andrew Ishaku Wreford et al.· Middle East Journal of Appli...· 0 citations
Metaheuristics require sustained global search without sacrificing local refinement, yet many variable-structure methods change operators through one-way iteration schedules. We introduce the Weather State Ants Optimizer (WSAO), in which a discrete-time Markov chain recurrently selects one of three population updates....