Oct 2026· Journal of Computational Design and Engineering· 0 citations
TL;DR
This paper proposes a Multi-Population Emperor Penguin Optimizer with Joint Opposite Selection (MLPEPO-JOS), an adaptive multi-population optimization framework that introduces a process innovation in how population coordination, diversity preservation, and opposition learning are integrated.
Abstract
Metaheuristic optimization algorithms are essential for solving complex and high-dimensional problems, yet their performance is often constrained by premature convergence and insufficient population diversity. Although the Emperor Penguin Optimizer (EPO) has demonstrated promising results, its single-population structure and static search behavior limit robustness and scalability. To overcome these drawbacks, this paper proposes a Multi-Population Emperor Penguin Optimizer with Joint Opposite Selection (MLPEPO-JOS), an adaptive multi-population optimization framework that introduces a process innovation in how population coordination, diversity preservation, and opposition learning are integrated. The proposed approach integrates three complementary mechanisms: an adaptive multi-population regulation strategy driven by real-time fitness improvement trends, an intelligent modular arithmetic-based division scheme that ensures balanced population partitioning under arbitrary population sizes, and a Joint Opposite Selection (JOS) mechanism that combines Selective Leading Opposition and Dynamic Opposition to enhance exploration-exploitation balance. MLPEPO-JOS is evaluated on 41 benchmark functions from the IEEE CEC2017 and CEC2022 suites, achieving the best mean ranking and competitive performance in terms of accuracy, robustness, and convergence behavior. Statistical analyses indicate significant improvements over many of the evaluated competitors, although the significance varies across individual comparisons.
Multi-objective optimization plays an important role in modern design and complex engineering applications. However, achieving an effective balance between the convergence and diversity of Pareto-optimal solutions remains challenging. This paper proposes a Sobol-driven Multi-objective Whale Migration Algorithm (SMOWMA)...
Li-Zhen Du, Dahongnian Zhou, Xiao-Shuang Xiong et al.· Biomimetics· 0 citations
Multimodal optimization problems (MMOPs) are a class of complex optimization problems that require locating multiple global optima accurately. While evolutionary computation (EC) algorithms are widely used for solving optimization problems, they often struggle to balance exploration and exploitation in solving MMOPs. M...
Ming-Kun Guo, Wen-Cong Huang, Yi Jiang et al.· International Conference on...· 0 citations
Experimental results demonstrate that the proposed hybrid strategy effectively overcomes the individual limitations of CMA-ES and GWO, making HCG a reliable method for solving complex continuous optimization problems.
Elias Ahmad Ahmadi, Besmillah Danish, Ahmad Ramin Rahnaward· Journal of Mathematics and S...· 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
A novel evolutionary algorithm termed CMOEA-TSD is proposed, which adopts a three-population, two-stage co-evolutionary framework to enhance diversity and coordinate multiple search behaviors and significantly outperforms seven state-of-the-art algorithms.
Metaheuristic algorithms are widely used to solve complex optimization problems, but the trade-off between exploration and exploitation often limits their performance. The Crested Porcupine Optimizer (CPO) employs four bio-inspired defense mechanisms and achieves competitive performance, but it still tends to converge...
Zhao-Yong Fan, Xi Li, Zhen-Hua Xiao et al.· Biomimetics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.