Adaptive memory-augmented Artificial Protozoa Optimization with competitive operator control for complex numerical and constrained problems

Reliable optimization of complex numerical and constrained problems requires algorithms that can exploit accumulated search experience without sacrificing population diversity. This paper proposes MAO-APO-RC, an enhanced Artificial Protozoa Optimizer that couples memory-augmented learning with adaptive competitive control. The method combines historical-solution guidance, quasi-oppositional sampling, Lévy-flight exploration, stagnation-triggered rescue, success-history parameter adaptation, and feedback-based operator scoring within a unified multi-candidate search framework. At every iteration, alternative candidates are produced by complementary operators, evaluated under a common selection rule, and reinforced according to their recent contribution, enabling dynamic regulation of exploration and exploitation. The performance was assessed in 30 independent runs on 15 benchmark functions including shifted, rotated, ill-conditioned, multimodal, hybrid and composition landscapes in 30 and 50 dimensions, and four constrained engineering design problems. The comparisons were made to APO, PSO, DE, GWO, WOA, SCA, CMAES-lite, and SHADE-lite. MAO-APO-RC achieved the best overall Friedman mean rank of 2.3667 on the numerical benchmark suite. Six of the eight competing algorithms were statistically significantly different with Wilcoxon–Holm analysis, whereas APO and SHADE-lite were statistically comparable. For the engineering problems, MAO-APO-RC obtained a joint-best mean rank of 1.875 with DE. Ablation analysis revealed the APO + QOD as the best reduced configuration with a mean rank of 1.8500 compared to 1.9167 for MAO-APO-RC whereas the complete framework significantly outperformed the Memory and Energy variants. Despite measurable constant-factor runtime overhead, MAO-APO-RC preserves APO’s asymptotic time and space complexity. These findings demonstrate that MAO-APO-RC provides competitive aggregate performance across the evaluated numerical and engineering problems, while its statistical advantage remains competitor- and problem-dependent.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-19
DOI
https://doi.org/10.1038/s41598-026-72467-1
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Adaptive memory-augmented Artificial Protozoa Optimization with competitive operator control for complex numerical and constrained problems

M. A. Elsabagh
Scientific Reports
Metaheuristic Optimization Algorithms Research
article

Adaptive memory-augmented Artificial Protozoa Optimization with competitive operator control for complex numerical and constrained problems

M. A. Elsabagh
article en

Abstract

Reliable optimization of complex numerical and constrained problems requires algorithms that can exploit accumulated search experience without sacrificing population diversity. This paper proposes MAO-APO-RC, an enhanced Artificial Protozoa Optimizer that couples memory-augmented learning with adaptive competitive control. The method combines historical-solution guidance, quasi-oppositional sampling, Lévy-flight exploration, stagnation-triggered rescue, success-history parameter adaptation, and feedback-based operator scoring within a unified multi-candidate search framework. At every iteration, alternative candidates are produced by complementary operators, evaluated under a common selection rule, and reinforced according to their recent contribution, enabling dynamic regulation of exploration and exploitation. The performance was assessed in 30 independent runs on 15 benchmark functions including shifted, rotated, ill-conditioned, multimodal, hybrid and composition landscapes in 30 and 50 dimensions, and four constrained engineering design problems. The comparisons were made to APO, PSO, DE, GWO, WOA, SCA, CMAES-lite, and SHADE-lite. MAO-APO-RC achieved the best overall Friedman mean rank of 2.3667 on the numerical benchmark suite. Six of the eight competing algorithms were statistically significantly different with Wilcoxon–Holm analysis, whereas APO and SHADE-lite were statistically comparable. For the engineering problems, MAO-APO-RC obtained a joint-best mean rank of 1.875 with DE. Ablation analysis revealed the APO + QOD as the best reduced configuration with a mean rank of 1.8500 compared to 1.9167 for MAO-APO-RC whereas the complete framework significantly outperformed the Memory and Energy variants. Despite measurable constant-factor runtime overhead, MAO-APO-RC preserves APO’s asymptotic time and space complexity. These findings demonstrate that MAO-APO-RC provides competitive aggregate performance across the evaluated numerical and engineering problems, while its statistical advantage remains competitor- and problem-dependent.

Scientific ReportsVol. 16(1)
Kafrelsheikh University (EG)
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon