This paper proposes a multi-strategy hybrid-enhanced Educational Competition Optimizer (MEECO) to improve the performance of swarm-based optimization algorithms in complex search environments. From the perspective of symmetry, population-based optimization algorithms inherently rely on the symmetric distribution and evolution of individuals in the search space, while the imbalance between exploration and exploitation often leads to symmetry breaking, resulting in premature convergence and loss of diversity. Unlike the standard ECO, which suffers from limited information exchange, premature convergence, and boundary stagnation, the proposed method integrates three complementary mechanisms: adaptive differential evolution, vertical crossover, and global-best-guided boundary handling. Specifically, the adaptive differential evolution strategy enhances global exploration and maintains population distribution symmetry through dynamic mutation, the vertical crossover mechanism improves inter-dimensional symmetry and information interaction, and the boundary-handling strategy restores symmetry by guiding infeasible solutions back to promising regions. These strategies jointly improve population diversity, exploration–exploitation balance, and convergence efficiency while preserving structural symmetry in the search process. Extensive experiments on CEC2017 and CEC2022 benchmark suites demonstrate that MEECO consistently achieves superior optimization accuracy, faster convergence speed, and stronger robustness compared with several state-of-the-art algorithms. Statistical analyses further confirm the significance and reliability of the improvements. In addition, the proposed method is applied to a wireless sensor network node deployment problem, where it significantly improves coverage rate and deployment uniformity. The results indicate that MEECO provides an effective, robust, and symmetry-preserving optimization framework for both benchmark problems and real-world engineering applications.
Sun et al. (Wed,) studied this question.