期刊文献+

The Colony Predation Algorithm 被引量:12

下载PDF
导出
摘要 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.
出处 《Journal of Bionic Engineering》 SCIE EI CSCD 2021年第3期674-710,共37页 仿生工程学报(英文版)
基金 This research was supported by the National Natural Science Foundation of China(62076185,U1809209).
  • 相关文献

参考文献2

二级参考文献36

  • 1Alava, M., Ardelius, J., Aurell, E., Kaski, P., Krishnamurthy, S., Orponen, E, Seitz, S., 2008. Circumspect descent prevails in solving random constraint satisfaction problems. PNAS, 105(40): 15253-15257. [doi:10.1073/pnas.0712263105].
  • 2Altarelli, F., Monasson, R., Smerjian, G., Zamponi, F., 2009. A Review of the Statistical Mechanics Approach to Random Optimization Problems. Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, Vol. 185. IOS Press, the Netherlands.
  • 3Bak, P., Sneppen, K., 1993. Punctuated equilibrium and criti cality in a simple model of evolution. Phys. Rev. Lett., 71(24):4083-4086. [doi:10.1103/PhysRevkett.71.4083].
  • 4Bak, P., Tang, C., Wiesenfeld, K., 1987. Self-organized criti cality: an explanation of the I/f noise. Phys. Rev. Lett., 59(4):381-384. [doi:10.1103/PhysRevLett.59.381].
  • 5Barthel, W., Hartmann, A.K., Weigt, M., 2003. Solving satisfiability problems by fluctuations: the dynamics of sto chastic local search algorithms. Phys. Rev. E, 67(6): 066104. [doi:10.1103/PhysRevE.67.066104].
  • 6Biere, A., Heule, M., Maaren, H., Walsh, T., 2009. Handbook of Satisfiabifity. IOS Press, the Netherlands.
  • 7Biroli, G., Cocco, S., Monasson, R., 2002. Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem. Phys. A, 306:381-394. [doi:10.1016/S0378-4371 (02)00516-2].
  • 8Boettcher, S., Percus, A.G., 2000. Nature's way of optimizing. Artif Intell., 119(1-2):275-286, [doi:10.10161S0004-3702 (00)00007-2].
  • 9Boettcher, S., Percus, A.G., 2001a. Optimization with extremal dynamics. Phys. Rev. Lett., 86(23):5211-5214. [doi:10. 1103/PhysRevLett.86.5211].
  • 10Boettcher, S., Percus, A.G., 200lb. Extremal optimization for graph partitioning. Phys. Rev. E, 64(2):026114. [doi:10. 1103/PhysRevE.64.026114].

共引文献19

同被引文献26

引证文献12

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部