ADVCSO: Adaptive Dynamically Enhanced Variant of Chicken Swarm Optimization for Combinatorial Optimization Problems.

Abstract

High-dimensional complex optimization problems are pervasive in engineering and scientific computing, yet conventional algorithms struggle to meet collaborative optimization requirements due to computational complexity. While Chicken Swarm Optimization (CSO) demonstrates an intuitive understanding and straightforward implementation for low-dimensional problems, it suffers from limitations including a low convergence precision, uneven initial solution distribution, and premature convergence. This study proposes an Adaptive Dynamically Enhanced Variant of Chicken Swarm Optimization (ADVCSO) algorithm. First, to address the uneven initial solution distribution in the original algorithm, we design an elite perturbation initialization strategy based on good point sets, combining low-discrepancy sequences with Gaussian perturbations to significantly improve the search space coverage. Second, targeting the exploration-exploitation imbalance caused by fixed role proportions, a dynamic role allocation mechanism is developed, integrating cosine annealing strategies to adaptively regulate flock proportions and update cycles, thereby enhancing exploration efficiency. Finally, to mitigate the premature convergence induced by single update rules, hybrid mutation strategies are introduced through phased mutation operators and elite dimension inheritance mechanisms, effectively reducing premature convergence risks. Experiments demonstrate that the ADVCSO significantly outperforms state-of-the-art algorithms on 27 of 29 CEC2017 benchmark functions, achieving a 2-3 orders of magnitude improvement in convergence precision over basic CSO. In complex composite scenarios, its convergence accuracy approaches that of the championship algorithm JADE within a 10^-2 magnitude difference. For collaborative multi-subproblem optimization, the ADVCSO exhibits a superior performance in both Multiple Traveling Salesman Problems (MTSPs) and Multiple Knapsack Problems (MKPs), reducing the maximum path length in MTSPs by 6.0% to 358.27 units while enhancing the MKP optimal solution success rate by 62.5%. The proposed algorithm demonstrates an exceptional performance in combinatorial optimization and holds a significant engineering application value.