Search-Trajectory Patterns as Feedback for Adaptive Metaheuristic Configuration Control
- 1Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
- 2Escuela de Ingeniería de Construcción y Transporte, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362804, Chile
Abstract
Adaptive decisions are often based on algorithm-specific feedback or simple indicators that provide limited information about the evolving search dynamics. This work investigates explicit pattern-based analysis of the search trajectory as a source of feedback for adaptive configuration control. A trajectory-driven framework is proposed in which Derivative Dynamic Time Warping (DDTW) analyzes the recent best-so-far fitness trajectory against reference patterns representing sustained progress and lack of progress. The resulting information regulates switching between predefined exploration- and exploitation-oriented parameter configurations. Two control strategies are introduced: Binary-Simple, which reacts directly to trajectory evidence associated with a plateau, and Binary-Complex, which incorporates multiple search conditions, temporal persistence, and asymmetric switching. The framework is evaluated on 27 Multidimensional Knapsack Problem instances using BPSO, GA, BGWO, and BDE, with 31 independent runs per condition. Results show that no fixed configuration consistently dominates across metaheuristics and instances, while the effects of trajectory-driven adaptation depend on the underlying algorithm. Across 108 metaheuristic–instance conditions, Binary-Complex achieves the best mean rank (2.13). The Friedman test detects an overall difference among strategies (p=7.73×10−5); Bonferroni-Dunn post-hoc comparisons favor Binary-Complex over both fixed configurations, but do not establish a difference from Binary-Simple. Moreover, a common trajectory-analysis parameterization produces different switching behaviors across the evaluated metaheuristics. These findings support explicit search-trajectory pattern analysis as a viable feedback mechanism for adaptive configuration control across different population-based metaheuristics.
Related
- Dual-Axis Policy Optimization for LLM Agents: Bayesian Feedback Attribution and Trajectory Mass Normalization
- Box-iLQR: Constraint-Aware Feedback via Finite-Barrier Trajectory Optimization
- Adaptive Node Distribution via Probability Density Functions for Birkhoff Pseudospectral Trajectory Optimisation
- Neural ODE enhanced linear mixed effect models for estimating complex association patterns of time-varying covariates with the marker trajectory
- Neural ODE enhanced linear mixed effect models for estimating complex association patterns of time-varying covariates with the marker trajectory Supplementary Materials
BibTeX
@article{villamayor2026searchtrajectory,
title = {{Search-Trajectory Patterns as Feedback for Adaptive Metaheuristic Configuration Control}},
author = {José Villamayor and Lucas Erazo and Ricardo Soto and José Garcia and Emanuel Vega},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14203715},
url = {https://www.mdpi.com/2227-7390/14/20/3715},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Search-Trajectory Patterns as Feedback for Adaptive Metaheuristic Configuration Control
AU - José Villamayor
AU - Lucas Erazo
AU - Ricardo Soto
AU - José Garcia
AU - Emanuel Vega
PY - 2026
DA - 2026/10/13
JO - Mathematics
DO - 10.3390/math14203715
UR - https://www.mdpi.com/2227-7390/14/20/3715
AB - Adaptive decisions are often based on algorithm-specific feedback or simple indicators that provide limited information about the evolving search dynamics. This work investigates explicit pattern-based analysis of the search trajectory as a source of feedback for adaptive configuration control. A trajectory-driven framework is proposed in which Derivative Dynamic Time Warping (DDTW) analyzes the recent best-so-far fitness trajectory against reference patterns representing sustained progress and lack of progress. The resulting information regulates switching between predefined exploration- and exploitation-oriented parameter configurations. Two control strategies are introduced: Binary-Simple, which reacts directly to trajectory evidence associated with a plateau, and Binary-Complex, which incorporates multiple search conditions, temporal persistence, and asymmetric switching. The framework is evaluated on 27 Multidimensional Knapsack Problem instances using BPSO, GA, BGWO, and BDE, with 31 independent runs per condition. Results show that no fixed configuration consistently dominates across metaheuristics and instances, while the effects of trajectory-driven adaptation depend on the underlying algorithm. Across 108 metaheuristic–instance conditions, Binary-Complex achieves the best mean rank (2.13). The Friedman test detects an overall difference among strategies (p=7.73×10−5); Bonferroni-Dunn post-hoc comparisons favor Binary-Complex over both fixed configurations, but do not establish a difference from Binary-Simple. Moreover, a common trajectory-analysis parameterization produces different switching behaviors across the evaluated metaheuristics. These findings support explicit search-trajectory pattern analysis as a viable feedback mechanism for adaptive configuration control across different population-based metaheuristics.
SN - 2227-7390
ER -