Aug 2026· Biomimetics· Vol 11, pp. 540· 1 citation· 53 references
Medicine
TL;DR
A chaotic discretization framework is presented that replaces the classical behavior of the two-step binarization technique to regulate the balance between exploration and exploitation and shows that the highest-performing chaotic mapping is heavily influenced by the specific landscape morphology evaluated.
Abstract
The transition from continuous swarm intelligence algorithms to discrete combinatorial domains remains a critical challenge in bio-inspired computing. Traditional binarization techniques frequently induce premature convergence in highly constrained landscapes. This paper presents a chaotic discretization framework that replaces the classical behavior of the two-step binarization technique to regulate the balance between exploration and exploitation. The proposal systematically integrates three leading continuous metaheuristics in the literature, with twenty-four binarization configurations, across three distinct NP-hard problem archetypes: capacity-constrained (0–1 Knapsack), sparse (Set Covering), and mathematically degenerate flat landscapes (Unicost Set Covering). Nonparametric statistical tests confirm that chaotic discretization acts as a powerful regulator in the landscape (p < 0.05). Empirical evidence shows that the highest-performing chaotic mapping is heavily influenced by the specific landscape morphology evaluated: the 0–1 Knapsack Problem is statistically optimized by the Circle map under standard rules; the Set Covering Problem achieves optimal median performance with the Tent map under elitist formulations, although severe matrix constraints ultimately force statistical ties; and the Unicost Set Covering Problem utilizes the nonlinear sequences of the sinusoidal map under complementary operators to break convergence stagnation.
Combinatorial optimization problems include many NP-hard problems such as assignment, scheduling, and routing, for which conventional approaches to solving become computationally infeasible for large instances, thereby necessitating the use of metaheuristics. This study introduces an algorithm, Adaptive Shannon Entropy...
Simi Kalathodi, Sarada Jayan, Bilal Alataş et al.· Biomimetics· 0 citations
This study proposes the Chaotic Sech-Tanh Dynamic Opposition-based Learning (CHSTDOBL) strategy, which integrates two complementary mechanisms into the dynamic opposition framework: pseudo-random sequences generated by the Ikeda chaotic map, which inject aperiodic variability to resist premature convergence, and hyperb...
M. Turgut, Mohammad Al-Rawi, O. Turgut et al.· Kerntechnik· 0 citations
Metaheuristic optimisation algorithms have received a lot of attention due to their ability to solve complicated optimisation problems without using any gradient information. However, the performance of these algorithms may be affected by insufficient exploration, premature convergence and getting stuck in local optima...
Ayeni J. A., I. W., Olanrewaju S. S.· International journal of res...· 0 citations
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...
Bio-inspiration has mainly been used to represent organisms, behaviors, or natural processes in the design of metaheuristics. This study proposes a different use: drawing on a biological phenomenon to model the temporal evolution of an internal parameter in an existing algorithm. Logarithmic Mean Optimization (LMO) is...