arrow
返回

Boxing Match Algorithm: a new meta-heuristic algorithm

delete2022-10-07
delete11
PRE
AI
M
Mehrab Tanhaeean
R
Reza Tavakkoli‐Moghaddam *
A
Amir Hosein Akbari
DOI:10.1007/s00500-022-07518-6delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This study presents a boxing match algorithm (BMA) as a new efficient meta-heuristic method to solve numerical optimization and NP-hard problems, such as knapsack. The proposed algorithm finds the best position (i.e., best solution) in the ring during the match (i.e., feasible solutions) through a simulation of the boxer's behavior, who can attract good support from his coach and fans to defeat his rival. The proposed algorithm is seeking good solutions by dividing the solution space into different sections and generating new solutions in each section through a semi-zigzag search. This division causes a proper and targeted search in the solution space to reach an efficient solution. Also, the unique boxer's movement in the ring (generating new solutions) enables the proposed BMA to give an acceptable level of performance in exploring the problem space. Several unconstrained mathematical, knapsack, and engineering benchmark problems undergo a standard test designed to confirm the powerful performance of the proposed BMA. A wide variety of complex numerical problems are solved and analyzed by a comparison between the results obtained from the test and the other well-known optimization methods. Quantitative data also indicate the proper performance of the proposed algorithm compared to the other ones. The results show that this algorithm can achieve 95% and 100% optimal solutions in 20 mathematical benchmark functions and eight examples of the knapsack problem, respectively.
Keyword:
Meta-heuristics
Boxing match algorithm
Optimization

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

U
University of Tehran
学者数:
2.4W
论文数: 2.3W
被引数: 2.7W
引用论文

引用论文

Human neuroglobin: crystals and preliminary X-ray diffraction analysis
err2002-09-28
err0
PREAI
errAlessandra Pesce; Marco Nardini; Sylvia Dewilde; Paolo Ascenzi; Thorsten Burmester; Thomas Hankeln; Luc Moens; Martino Bolognesi
err分享
err收藏
Red deer algorithm (RDA): a new nature-inspired meta-heuristic马鹿算法 (RDA): 一种新的自然启发的元启发式算法
err2020-03-10
err318
PREAI
errFathollahi-Fard, Amir Mohammad; Hajiaghaei-Keshteli, Mostafa; Tavakkoli-Moghaddam, Reza
err分享
err收藏
Golden eagle optimizer: A nature-inspired metaheuristic algorithm金鹰优化器: 一种自然启发的元启发式算法
err2021-02-01
err255
PREAI
errMohammadi-Balani, Abdolkarim; Nayeri, Mahmoud Dehghan; Azar, Adel; Taghizadeh-Yazdi, Mohammadreza
err分享
err收藏
Grey Wolf Optimizer灰狼优化器
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
err分享
err收藏
The pilot Stroke Data Bank: definition, design, and data.
err1984-07-01
err0
errOAAI
errS C Kunitz; C R Gross; A Heyman; C S Kase; J P Mohr; T R Price; P A Wolf
err分享
err收藏
学者 查看更多内容