.png){kind=icon}
返回
BinBRO: Binary Battle Royale Optimizer algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.116599.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stochastic methods attempt to solve problems that cannot be solved by deterministic methods with reasonable time complexity. Optimization algorithms benefit from stochastic methods; however, they do not guarantee to obtain the optimal solution. Many optimization algorithms have been proposed for solving problems with continuous nature; nevertheless, they are unable to solve discrete or binary problems. Adaptation and use of continuous optimization algorithms for solving discrete problems have gained growing popularity in recent decades. In this paper, the binary version of a recently proposed optimization algorithm, Battle Royale Optimization, which we named BinBRO, has been proposed. The proposed algorithm has been applied to two benchmark datasets: the uncapacitated facility location problem, and the maximum-cut graph problem, and has been compared with 6 other binary optimization algorithms, namely, Particle Swarm Optimization, different versions of Genetic Algorithm, and different versions of Artificial Bee Colony algorithm. The BinBRO-based algorithms could rank first among those algorithms when applying on all benchmark datasets of both problems, UFLP and Max-Cut.
Keyword:
Optimization
Discrete optimization
Battle Royale Optimization algorithm
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains
PREAI
分享收藏Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响
OAAI
OAAI分享收藏
查看更多内容