Journal of Bionic Engineering ›› 2021, Vol. 18 ›› Issue (3): 674-710.doi: 10.1007/s42235-021-0050-y

• • 上一篇    下一篇

The Colony Predation Algorithm

Jiaze Tu1, Huiling Chen1*, Mingjing Wang1, Amir H. Gandomi2   

  1. 1. College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou 325035, China
    2. Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW 2007, Australia
  • 收稿日期:2020-12-14 修回日期:2021-01-29 接受日期:2021-04-27 出版日期:2021-05-10 发布日期:2021-11-30
  • 通讯作者: Huiling Chen E-mail:chenhuiling.jlu@gmail.com
  • 作者简介:Jiaze Tu1, Huiling Chen1*, Mingjing Wang1, Amir H. Gandomi2

The Colony Predation Algorithm
#br#

Jiaze Tu1, Huiling Chen1*, Mingjing Wang1, Amir H. Gandomi2   

  1. 1. College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou 325035, China
    2. Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW 2007, Australia
  • Received:2020-12-14 Revised:2021-01-29 Accepted:2021-04-27 Online:2021-05-10 Published:2021-11-30
  • Contact: Huiling Chen E-mail:chenhuiling.jlu@gmail.com
  • About author:Jiaze Tu1, Huiling Chen1*, Mingjing Wang1, Amir H. Gandomi2

摘要: This paper proposes a new stochastic optimizer called the Colony Predation Algorithm (CPA) based on the corporate predation of animals in nature. CPA utilizes a mathematical mapping following the strategies used by animal hunting groups, such as dispersing prey, encircling prey, supporting the most likely successful hunter, and seeking another target. Moreover, the proposed CPA introduces new features of a unique mathematical model that uses a success rate to adjust the strategy and simulate hunting animals’ selective abandonment behavior. This paper also presents a new way to deal with cross-border situations, whereby the optimal position value of a cross-border situation replaces the cross-border value to improve the algorithm’s exploitation ability. The proposed CPA was compared with state-of-the-art metaheuristics on a comprehensive set of benchmark functions for performance verification and on five classical engineering design problems to evaluate the algorithm’s efficacy in optimizing engineering problems. The results show that the proposed algorithm exhibits competitive, superior performance in different search landscapes over the other algorithms. Moreover, the source code of the CPA will be publicly available after publication. 


关键词: Colony Predation, Algorithm optimization, nature-inspired computing, meta-heuristic;engineering problems


Abstract: This paper proposes a new stochastic optimizer called the Colony Predation Algorithm (CPA) based on the corporate predation of animals in nature. CPA utilizes a mathematical mapping following the strategies used by animal hunting groups, such as dispersing prey, encircling prey, supporting the most likely successful hunter, and seeking another target. Moreover, the proposed CPA introduces new features of a unique mathematical model that uses a success rate to adjust the strategy and simulate hunting animals’ selective abandonment behavior. This paper also presents a new way to deal with cross-border situations, whereby the optimal position value of a cross-border situation replaces the cross-border value to improve the algorithm’s exploitation ability. The proposed CPA was compared with state-of-the-art metaheuristics on a comprehensive set of benchmark functions for performance verification and on five classical engineering design problems to evaluate the algorithm’s efficacy in optimizing engineering problems. The results show that the proposed algorithm exhibits competitive, superior performance in different search landscapes over the other algorithms. Moreover, the source code of the CPA will be publicly available after publication. 


Key words: Colony Predation, Algorithm optimization, nature-inspired computing, meta-heuristic;engineering problems