8 March 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
The coordination of population structure is the foundation for the effective functioning of evolutionary algorithms. An efficient population evolution structure can guide individuals to engage in successful and robust exploitative and exploratory behaviors. However, due to the black-box property of the search process, it is challenging to assess the current state of the population and implement targeted measures. In this paper, we propose a dynamic population structures-based differential evolution algorithm (DPSDE) to uncover the real-time state of population continuous optimization. According to the exploitation and exploration state of population, we introduce four structural modules to address the premature convergence and search stagnation issues of the current population. To effectively utilize these modules, we propose a real-time discernment mechanism to judge the population's current state. Based on the feedback information, suitable structural modules are dynamically invoked, ensuring that the population undergoes continuous and beneficial evolution, ultimately exploring the optimal population structure. The comparative outcomes with numerous cutting-edge algorithms on the IEEE Congress on Evolutionary Computation (CEC) 2017 benchmark functions and 2011 real-world problems verify the superiority of DPSDE. Furthermore, parameters, population state, and ablation study of modules are discussed.
14 October 2021 in International Journal of Computational Intelligence Systems
The algorithm wingsuit flying search (WFS) mimics the procedure of landing the vehicle. The outstanding feature of WFS is parameterless and of rapid convergence. However, WFS also has its shortcomings, sometimes it will inevitably be trapped into local optima, thereby yield inferior solutions owing to its relatively weak exploration ability. Spherical evolution (SE) adopts a novel spherical search pattern that takes aim at splendid search ability. Cooperative coevolution is a useful parallel structure for reconciling algorithmic performance. Considering the complementary strengths of both algorithms, we herein propose a new hybrid algorithm that is comprised of SE and WFS using cooperative coevolution. During the search for optimal solutions in WFS, we replaced the original search matrix and introduced the spherical mechanism of SE, in parallel with coevolution to enhance the competitiveness of the population. The two distinct search dynamics were combined in a parallel and coevolutionary way, thereby getting a good search performance. The resultant hybrid algorithm, CCWFSSE, was tested on the CEC2017 benchmark set and 22 CEC 2011 real-world problems. The experimental data obtained can verify that CCWFSSE outperforms other algorithms in aspects of effectiveness and robustness.
27 December 2025 in Neurocomputing
14 June 2025 in Swarm and Evolutionary Computation
8 July 2023 in Environmental Modeling & Assessment
27 December 2025 in Information Fusion