Answers are grounded in this paper and cite their sources.
Presents SDAO, a new algorithm that improves optimization in complex environments, suggesting a better solution for high-dimensional problems.
This study presents Stochastic Diffusion Adaptive Optimization (SDAO) , a novel metaheuristic algorithm grounded in diffusion dynamics and stochastic modeling. The proposed method replaces traditional gradient descent with a density-driven diffusion mechanism, derived from Fick’s second law, allowing particles to escape densely populated regions and effectively explore sparsely sampled areas. SDAO incorporates global and individual guidance mechanisms, adaptive parameter tuning, opposition-based learning, and periodic bound contraction to enhance convergence behavior. Comprehensive experiments were conducted across four benchmark categories-standard, stochastic, CEC, and real-world problems-under various dimensional settings ( $$d = 10$$ to $$d = 100$$ ). The algorithm consistently demonstrated competitive performance and significantly outperformed state-of-the-art methods, including SHADEwithILS, AMSO, and TLPSO, particularly in noisy and high-dimensional environments. Statistical validation using ANOVA, Tukey’s HSD, and Wilcoxon tests confirmed the significance and robustness of the observed performance improvements. These results establish SDAO as a promising solution for complex, high-dimensional, and uncertainty-laden optimization problems, with broad applicability to real-world scenarios.
No takes yet. Share an insight, caveat, or question.
Ricardo M. Leal Lopez (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: