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. © 2022 Elsevier Ltd
Eser Adı (dc.title) | BinBRO: Binary Battle Royale Optimizer algorithm |
Yazar (dc.contributor.author) | Taymaz Akan |
Yayın Yılı (dc.date.issued) | 2022 |
Tür (dc.type) | Makale |
Özet (dc.description.abstract) | 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. © 2022 Elsevier Ltd |
Açık Erişim Tarihi (dc.date.available) | 2022-06-01 |
Yayıncı (dc.publisher) | Expert Systems with Applications |
Dil (dc.language.iso) | En |
Konu Başlıkları (dc.subject) | Battle Royale Optimization algorithm |
Konu Başlıkları (dc.subject) | Discrete optimization; Optimization |
Konu Başlıkları (dc.subject) | Optimization |
Tek Biçim Adres (dc.identifier.uri) | https://hdl.handle.net/20.500.14081/1410 |
ISSN (dc.identifier.issn) | 0957-4174 |
Dergi (dc.relation.journal) | Expert Systems With Applications |
Esere Katkı Sağlayan (dc.contributor.other) | Akan (Rahkar Farshi), Taymaz |
Esere Katkı Sağlayan (dc.contributor.other) | Agahian, Saeid |
Esere Katkı Sağlayan (dc.contributor.other) | Dehkharghani, Rahim |
DOI (dc.identifier.doi) | 10.1016/j.eswa.2022.116599 |
Orcid (dc.identifier.orcid) | 0000-0003-4070-1058 |
Dergi Cilt (dc.identifier.volume) | 195 |
wosquality (dc.identifier.wosquality) | Q1 |
wosauthorid (dc.contributor.wosauthorid) | S-4564-2019 |
Department (dc.contributor.department) | Yazılım Mühendisliği |
Wos No (dc.identifier.wos) | WOS:000787281000010 |
Veritabanları (dc.source.platform) | Wos |
Veritabanları (dc.source.platform) | Scopus |