Chicken swarm optimization with an enhanced exploration-exploitation tradeoff and its application

Abstract

Abstract The chicken swarm optimization (CSO) is a novel swarm intelligence algorithm, which mimics the hierarchal order and foraging behavior in the chicken swarm. However, like other population-based algorithms, CSO also suffers from slow convergence and easily falls into local optima, which partly results from the unbalance between exploration and exploitation. To tackle this problem, this paper proposes a chicken swarm optimization with an enhanced exploration-exploitation tradeoff (CSO-EET). To be specific, the search process in CSO-EET is divided into two stages (i.e., exploration and exploitation) according to the swarm diversity. In the exploratory search process, a random solution is employed to find promising solutions. In the exploitative search process, the best solution is used to accelerate convergence. Guided by the swarm diversity, CSO-EET alternates between exploration and exploitation. To evaluate the optimization performance of CSO-EET in both theoretical and practical problems, it is compared with other improved CSO variants and several state-of-the-art algorithms on twenty-two benchmark functions and two real-world problems (i.e., circle packing problem and survival risk prediction of esophageal cancer). The experimental results show that CSO-EET is better than or at least com-parable to all competitors in most cases.