Battle Royale Optimizer for solving binary optimization problems
Künye
Akan, T., Agahian, S. & Dehkharghani, R. (2022). Battle Royale Optimizer for solving binary optimization problems. Software Impacts, 12, 1-4. doi:10.1016/j.simpa.2022.100274Özet
Battle Royale Optimizer (BRO) is a recently proposed metaheuristic optimization algorithm used only in continuous problem spaces. The BinBRO is a binary version of BRO. The BinBRO algorithm employs a differential expression, which utilizes a dissimilarity measure between binary vectors instead of a vector subtraction operator, used in the original BRO algorithm to find the nearest neighbor. To evaluate BinBRO, we applied it to two popular benchmark datasets: the uncapacitated facility location problem (UFLP) and the maximum-cut (Max-Cut) graph problems from OR-Library. An open-source MATLAB implementation of BinBRO is available on CodeOcean and GitHub websites.
Kaynak
Software ImpactsCilt
12İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Improving the calibration time of traffic simulation models using parallel computing technique
Dadashzadeh, Nima; Ergün, Murat; Kesten, Ali Sercan; Zura, Marijan (Institute of Electrical and Electronics Engineers Inc., 2019-06)The calibration procedure for traffic simulation models can be a very time-consuming process in the case of a large-scale and complex network. In the application of Evolutionary Algorithms (EA) such as Genetic Algorithms ... -
BinBRO: Binary Battle Royale Optimizer algorithm
(Rahkar Farshi), Taymaz Akan; Agahian, Saeid; Dehkharghani, Rahim (Elsevier Ltd, 2022-02-04)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 ... -
Searching for the optimal ordering of classes in rule induction
Ata, Sezin; Yıldız, Olcay Taner (IEEE, 2012-11-15)Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...