All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

BinBRO: Binary Battle Royale Optimizer algorithm

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    BinBRO: Binary Battle Royale Optimizer algorithm

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20200 - Electrical engineering, Electronic engineering, Information engineering

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Expert Systems with Applications

  • ISSN

    0957-4174

  • e-ISSN

    1873-6793

  • Volume of the periodical

    195

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    13

  • Pages from-to

  • UT code for WoS article

    000787281000010

  • EID of the result in the Scopus database

    2-s2.0-85124186413