BinBRO: Binary Battle Royale Optimizer algorithm

dc.authorid0000-0003-4070-1058
dc.authorid0000-0003-2462-6166
dc.authorid0000-0002-9619-8247
dc.contributor.author(Rahkar Farshi), Taymaz Akanen_US
dc.contributor.authorAgahian, Saeiden_US
dc.contributor.authorDehkharghani, Rahimen_US
dc.date.accessioned2022-02-22T17:13:23Z
dc.date.available2022-02-22T17:13:23Z
dc.date.issued2022-02-04
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Computer Engineeringen_US
dc.description.abstractStochastic 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.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citation(Rahkar Farshi), T. A., Agahian, S. & Dehkharghani, R. (2022). BinBRO: Binary Battle Royale Optimizer algorithm. Expert Systems with Applications, 195, 1-13. doi:10.1016/j.eswa.2022.116599en_US
dc.identifier.doi10.1016/j.eswa.2022.116599
dc.identifier.endpage13
dc.identifier.issn0957-4174
dc.identifier.issn1873-6793
dc.identifier.scopus2-s2.0-85124186413
dc.identifier.scopusqualityQ1
dc.identifier.startpage1
dc.identifier.urihttps://hdl.handle.net/11729/3449
dc.identifier.urihttp://dx.doi.org/10.1016/j.eswa.2022.116599
dc.identifier.volume195
dc.identifier.wosWOS:000787281000010
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakScience Citation Index Expanded (SCI-EXPANDED)en_US
dc.institutionauthorDehkharghani, Rahimen_US
dc.institutionauthorid0000-0002-9619-8247
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofExpert Systems with Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBattle Royale Optimization algorithmen_US
dc.subjectBenchmark datasetsen_US
dc.subjectComputational complexityen_US
dc.subjectDiscrete optimizationen_US
dc.subjectDiscrete problemsen_US
dc.subjectDeterministic methodsen_US
dc.subjectGenetic algorithmsen_US
dc.subjectOptimizationen_US
dc.subjectOptimisationsen_US
dc.subjectOptimization algorithmsen_US
dc.subjectOptimizersen_US
dc.subjectParticle swarm optimization (PSO)en_US
dc.subjectStochastic methodsen_US
dc.subjectStochastic systemsen_US
dc.subjectTime complexityen_US
dc.subjectBee colony algorithmen_US
dc.subjectSearchen_US
dc.titleBinBRO: Binary Battle Royale Optimizer algorithmen_US
dc.typeArticleen_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
11729-3449.pdf
Boyut:
3.35 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama: