skip to main content

The Colony Predation Algorithm

Tu, Jiaze ; Chen, Huiling ; Wang, Mingjing ; Gandomi, Amir H.

Journal of bionics engineering, 2021-05, Vol.18 (3), p.674-710 [Periódico revisado por pares]

Singapore: Springer Singapore

Texto completo disponível

Citações Citado por
  • Título:
    The Colony Predation Algorithm
  • Autor: Tu, Jiaze ; Chen, Huiling ; Wang, Mingjing ; Gandomi, Amir H.
  • Assuntos: Artificial Intelligence ; Biochemical Engineering ; Bioinformatics ; Biomaterials ; Biomedical Engineering and Bioengineering ; Biomedical Engineering/Biotechnology ; Engineering
  • É parte de: Journal of bionics engineering, 2021-05, Vol.18 (3), p.674-710
  • Descrição: 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.
  • Editor: Singapore: Springer Singapore
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.