计算机科学
数学优化
最优化问题
启发式
空格(标点符号)
全局优化
人工智能
算法
数学
操作系统
作者
Hernán Peraza-Vázquez,Adrián F. Peña-Delgado,Prakash Ranjan,Chetan Barde,Arvind Choubey,Ana Beatriz Morales‐Cepeda
出处
期刊:Mathematics
[MDPI AG]
日期:2021-12-29
卷期号:10 (1): 102-102
被引量:44
摘要
This paper proposes a new meta-heuristic called Jumping Spider Optimization Algorithm (JSOA), inspired by Arachnida Salticidae hunting habits. The proposed algorithm mimics the behavior of spiders in nature and mathematically models its hunting strategies: search, persecution, and jumping skills to get the prey. These strategies provide a fine balance between exploitation and exploration over the solution search space and solve global optimization problems. JSOA is tested with 20 well-known testbench mathematical problems taken from the literature. Further studies include the tuning of a Proportional-Integral-Derivative (PID) controller, the Selective harmonic elimination problem, and a few real-world single objective bound-constrained numerical optimization problems taken from CEC 2020. Additionally, the JSOA’s performance is tested against several well-known bio-inspired algorithms taken from the literature. The statistical results show that the proposed algorithm outperforms recent literature algorithms and is capable to solve challenging real-world problems with unknown search space.
科研通智能强力驱动
Strongly Powered by AbleSci AI