BinBRO: Binary Battle Royale Optimizer algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F22%3A39921586" target="_blank" >RIV/00216275:25530/22:39921586 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0957417422000938?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0957417422000938?via%3Dihub</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.eswa.2022.116599" target="_blank" >10.1016/j.eswa.2022.116599</a>

Jazyk výsledku

angličtina

Název v původním jazyce

BinBRO: Binary Battle Royale Optimizer algorithm

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

BinBRO: Binary Battle Royale Optimizer algorithm

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20200 - Electrical engineering, Electronic engineering, Information engineering

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Expert Systems with Applications

ISSN

0957-4174

e-ISSN

1873-6793

Svazek periodika

195

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

13

Strana od-do

—

Kód UT WoS článku

000787281000010

EID výsledku v databázi Scopus

2-s2.0-85124186413