Skip to content
Book Open access

Quantifying the Explore-Exploit Trade-off in Metaheuristics via Normalised Positional Diversity

Jul 2026 · GECCO Companion · pp. 713-716 · 0 citations · 6 references
Computer Science

TL;DR

This study introduces a standardized framework based on a Normalized Positional Diversity Index (D*) to quantify optimizer behaviour and demonstrates that D* is a geometric generalization of existing measures, by replacing stochastic, path-dependent historical maximums with a fixed global upper bound anchored to the search space geometry.

Abstract

A continuous development of metaheuristics necessitates a deeper understanding of internal search mechanisms, specifically the transition between exploration and exploitation, which is often overlooked in favour of final fitness values. This study introduces a standardized framework based on a Normalized Positional Diversity Index (D*) to quantify optimizer behaviour. We demonstrate that D* is a geometric generalization of existing measures, such as the one proposed by Hussain et al. [1], by replacing stochastic, path-dependent historical maximums with a fixed global upper bound anchored to the search space geometry. This transformation eliminates post-hoc bias and provides a scale-independent diagnostic. From D*, additional metrics including Area Under the Curve (AUC) and crossover point (txover) are derived to identify exact phase transitions. We evaluate five optimizers (GWO, DE, PSO, AGOA, and EES) across CEC 2020 benchmarks. Results confirm that D* offers consistent diversity monitoring with lower Coefficients of Variation compared to existing measures. Code and supplementary materials are available at: [https://github.com/saiddddd/D-Star-Metric-Optimization].

Read PDF

Similar papers

Open access Jul 2026

A Comparative Study of Metaheuristics on Raspberry Pi 5: Results to Guide Optimization on Constrained Edge 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.

Ziadan Qowi, Akhdan Musyaffa Firdaus, Hari Purnama · 0 citations
Jul 2026

MLDGWO: a grey wolf optimizer with momentum, leader adjustment, and differential perturbation for global optimization problems

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 · 0 citations
Book Open access Jul 2026

Benchmarking Metaheuristics for Mixed-Integer Optimization

This paper compares six different strategies identified in a recent survey, categorizing them as either global strategies (GS), which treat the decision vector as a unified type, or decomposition-based strategies (DS), which split the problem into continuous and discrete subproblems.

Thomas Lang, Denis Pallez · 0 citations
Jul 2026

Provable Speedups From Dynamic Population Sizes in Evolutionary Algorithms for Multiobjective Optimization

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.

Andre Opris · 0 citations
Open access Sep 2026

Weather State Ants Optimizer: A Markov-Driven Variable-Structure Metaheuristic

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....

Xiu-Bo Xia, Jian Sun, Xiao-Yun Geng 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

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