Chase and Escape Optimization Algorithm

Abstract

Abstract This paper proposes a new optimization algorithm called Chase and Escape (CHE). The proposed CHE is based on a hunting strategy for a group of predators attacking a group of prey. The mathematical model of CHE algorithm is built on three phases. First, the predators begin by approaching and encircling the prey from all sides. The second phase is the attacking process, where the predator decides to attack the prey. Third, is the escape process, where the prey assesses the level of threat and decides whether to escape or remain in its alert zone. To assess the performance of the proposed algorithm, it is tested and evaluated on CEC-2017 benchmark functions, and its performance is compared to different cutting-edge optimization algorithms. Experimental results and Friedman mean rank test reveal that the proposed CHE outperforms the majority of the other algorithms. Furthermore, the proposed algorithm CHE is applied to four real-world engineering problems, and the results are compared with the state-of-the-art literature. The comparative results revealed that the proposed CHE algorithm is quite promising, producing better results than most of the similar recent work in the literature.