










Abstract:This paper presents a principled framework for designing energy-aware metaheuristics that operate under fixed energy budgets. We introduce a unified operator-level model that quantifies both numerical gain and energy usage, and define a robust Expected Improvement per Joule (EI/J) score that guides adaptive selection among operator variants during the search. The resulting energy-aware solvers dynamically choose between operators to self-control exploration and exploitation, aiming to maximize fitness gain under limited energy. We instantiate this framework with three representative metaheuristics - steady-state GA, PSO, and ILS - each equipped with both lightweight and heavy operator variants. Experiments on three heterogeneous combinatorial problems (Knapsack, NK-landscapes, and Error-Correcting Codes) show that the energy-aware variants consistently reach comparable fitness while requiring substantially less energy than their non-energy-aware baselines. EI/J values stabilize early and yield clear operator-selection patterns, with each solver reliably self-identifying the most improvement-per-Joule - efficient operator across problems.
From: Tomohiro Harada Dr. [view email]
[v1]
Fri, 6 Feb 2026 10:47:02 UTC (3,311 KB)
[v2]
Mon, 9 Feb 2026 15:49:17 UTC (3,312 KB)
[v3]
Thu, 12 Mar 2026 15:53:44 UTC (3,312 KB)
[v4]
Tue, 21 Apr 2026 01:36:23 UTC (3,312 KB)
[v5]
Wed, 22 Jul 2026 11:23:04 UTC (3,312 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。