Aug 2026· 2026 12th International Conference on Big Data and Information Analytics (BigDIA)· pp. 1476-1483· 0 citations· 32 references
Abstract
Differential evolution (DE) is widely used in numerical optimization, but fixed parameters and a single mutation strategy make it difficult to coordinate exploration and exploitation across different search stages. To address this issue, this paper proposes Bio-EbDE, a DE algorithm with stage-aware mutation strategy switching, subpopulation-specific parameter adaptation, and a local optimum escape mechanism. Its main distinction lies in three coordinated designs: mutation strategies are selected according to both evolutionary stage and subpopulation role; the scaling factor F is generated from different distributions for different subpopulations; and a spray-melon-inspired perturbation generates offspring with adaptive dispersal when premature convergence is detected. Experiments on CEC2013, CEC2022, and a constrained engineering problem show that Bio-EbDE achieves competitive optimization accuracy and convergence behavior.
TSDE-SSA balances global and local search effectively, offering an efficient and stable solution for complex optimization problems with broad application potential.
The experimental results show that FMDM-DE demonstrates superiority or strong competitiveness over seven state-of-the-art algorithms in terms of mean squared error, standard deviation, and optimization accuracy, indicating its excellent robustness and optimization capability.
Li-Qi Zhao, Zheng-Hao Song, Liang-Liang Sun et al.· Cluster Computing· 0 citations
: The Artificial Protozoa Optimizer (APO) is a population-based metaheuristic for numerical optimization and engineering design. However, its stochastic initialization and limited local refinement can reduce performance on non-convex, discontinuous, and high-dimensional landscapes. To address these issues, this paper p...
Dingfeng Song, Haibo Wang, Zhiwei Ye et al.· Computers, Materials & C...· 0 citations
Cuckoo Search Algorithm (CSA) has emerged as a powerful bio-inspired metaheuristic, yet its reliance on random-walk search often leads to slow convergence and susceptibility to local optima. This study introduces an Adaptive Elite Cuckoo Search Algorithm (AECSA), designed to enhance both convergence speed and solution...
P. Ong, Jia-Hang Wu· Journal of Computing Researc...· 0 citations
Attraction-Repulsion Optimization Algorithm (AROA) is a recently proposed meta-heuristic algorithm known for its simplicity, ease of implementation, and robustness. However, AROA may converge to local optima when applied to complex optimization problems. To address this limitation, we propose an enhanced version called...
Fang Feng, Kuan-Ching Li, Mingjiang Cai et al.· International Journal of Int...· 0 citations
The Artificial Bee Colony (ABC) algorithm demonstrates strong exploration but converges slowly. To address this, AMRABC_Ts introduces an adaptive dimension modification rate mechanism with two search strategies. The exploration-favoured CABC strategy uses random guidance, while the exploitation-favoured MABC_order stra...
Yang Cao, Xiao-Quan Yuan, Jing-Zheng Luan· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.