Piranha predation optimization algorithm (PPOA) for global optimization and engineering design problems

被引:1
|
作者
Zhang, Chunliang [1 ,2 ]
Li, Huang [1 ]
Long, Shangbin [1 ,2 ]
Yue, Xia [1 ,2 ]
Ouyang, Haibin [1 ,2 ]
Chen, Zeyu [1 ]
Li, Steven [3 ]
机构
[1] Guangzhou Univ, Sch Mech & Elect Engn, Guangzhou 510006, Peoples R China
[2] Guangzhou Univ, Guangzhou Key Lab Mech & Elect Equipment Status Mo, Guangzhou 510006, Peoples R China
[3] RMIT Univ, Grad Sch Business & Law, Melbourne, Vic 3000, Australia
基金
中国国家自然科学基金;
关键词
Piranha predation optimization algorithm; Meta-heuristic algorithm; Global optimization; Piranha predation; Engineering applications; FEATURE-SELECTION;
D O I
10.1016/j.asoc.2024.112085
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new nature-inspired optimization algorithm, Piranha predation optimization algorithm (PPOA), is proposed based on the unique foraging and predation behaviors of piranhas. Briefly, PPOA consists of three optimization operations, i.e., narrowing down to tear prey, swimming in a straight line, and swimming in a spiral. In this paper, various mathematical models for simulating the behavioral operators are presented in detail to solve different optimization challenges effectively. In this paper, the performance of PPOA is rigorously tested on 23 benchmark optimization functions, CEC2017 competition test set, CEC2020 real-world engineering optimization problems and four engineering design applications to show the applicability of the algorithm in different applications. Comparison experiments with other good and advanced competitive algorithms are conducted to reveal the advantages and performance of PPOA by using performance metrics such as Wilcoxon rank sum test and Friedman mean rank. The comparative results of this paper demonstrate the effectiveness of the proposed algorithmic strategy and its potential in applying it to solving optimization real-world engineering optimization problems.
引用
收藏
页数:41
相关论文
共 50 条
  • [41] A hybrid TLNNABC algorithm for reliability optimization and engineering design problems
    Kundu, Tanmay
    Garg, Harish
    ENGINEERING WITH COMPUTERS, 2022, 38 (06) : 5251 - 5295
  • [42] A hybrid TLNNABC algorithm for reliability optimization and engineering design problems
    Tanmay Kundu
    Harish Garg
    Engineering with Computers, 2022, 38 : 5251 - 5295
  • [43] An integrated firefly algorithm for the optimization of constrained engineering design problems
    Tao, Ran
    Zhou, Huanlin
    Meng, Zeng
    Liu, Zhaotao
    SOFT COMPUTING, 2024, 28 (04) : 3207 - 3250
  • [44] Comprehensive learning Jaya algorithm for engineering design optimization problems
    Zhang, Yiying
    Jin, Zhigang
    JOURNAL OF INTELLIGENT MANUFACTURING, 2022, 33 (05) : 1229 - 1253
  • [45] A balanced whale optimization algorithm for constrained engineering design problems
    Chen, Huiling
    Xu, Yueting
    Wang, Mingjing
    Zhao, Xuehua
    APPLIED MATHEMATICAL MODELLING, 2019, 71 : 45 - 59
  • [46] An integrated firefly algorithm for the optimization of constrained engineering design problems
    Ran Tao
    Huanlin Zhou
    Zeng Meng
    Zhaotao Liu
    Soft Computing, 2024, 28 : 3207 - 3250
  • [47] Improved whale algorithm for solving engineering design optimization problems
    Liu J.
    Ma Y.
    Li Y.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (07): : 1884 - 1897
  • [48] EABOA: Enhanced adaptive butterfly optimization algorithm for numerical optimization and engineering design problems
    He, Kai
    Zhang, Yong
    Wang, Yu-Kun
    Zhou, Rong-He
    Zhang, Hong-Zhi
    ALEXANDRIA ENGINEERING JOURNAL, 2024, 87 : 543 - 573
  • [49] An improved gray wolf optimization algorithm solving to functional optimization and engineering design problems
    Qiu, Yihui
    Yang, Xiaoxiao
    Chen, Shuixuan
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [50] AN ALGORITHM FOR ENGINEERING DESIGN OPTIMIZATION
    BELSARE, SV
    ARORA, JS
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1983, 19 (06) : 841 - 858