arrow
返回

A new human-based offensive defensive optimization algorithm for solving optimization problems

delete2025-04-09
delete0
delete
OA
AI
N
Ning Fang
C
Cheng-Zhong Xu
G
Gong, Xuxiong
Z
Zhouhua Wu *
DOI:10.1038/s41598-025-96559-6delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
A novel human-inspired metaheuristic algorithm, termed Offensive Defensive Optimization, has been introduced to address single-objective optimization problems. This algorithm draws inspiration from the varied strategies utilized by players in board games, emulating and conceptualizing offensive and defensive behaviors within a hybrid search framework. The integration of mixed search behaviors facilitates a more efficient exploration and exploitation of the search space, thereby enhancing the algorithm's capability to surmount local minima. The algorithm was evaluated using the benchmark test suites from the Congress on Evolutionary Computation (CEC) 2017 and 2022, in addition to two real-world engineering design problems. In comparison to eight well-established metaheuristic algorithms, the proposed method demonstrated superior performance in 80% of the CEC2017 cases and 72% of the CEC2022 cases, with statistically significant improvements. The results further indicate that the proposed algorithm exhibits satisfactory convergence efficiency, along with robust exploration and exploitation capabilities, while maintaining a balanced equilibrium between these two processes. Additionally, the outcomes of the engineering design problems suggest that the proposed algorithm effectively manages optimization tasks, demonstrating clear superiority and enhanced competitiveness.
Keyword:
Global optimization
Metaheuristic algorithm
(CEC) 2017 benchmarks functions
Human-based
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Scientific Reports 封面图
Scientific Reports
IF:
3.9
论文数:
28.3W
被引数:
108.6W

机构

北京航空航天大学 封面图
北京航空航天大学
学者数:
7
论文数: 2
被引数: 3.2W
引用论文

引用论文

暂无论文信息