BinBRO: Binary Battle Royale Optimizer algorithm
Künye
(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.116599Özet
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.
Kaynak
Expert Systems with ApplicationsCilt
195Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İ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 ... -
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 ... -
Gerçel ve karmaşık süzgeç öbeklerinin eşdalgacıklı tasarımı
Ateş, Hasan Fehmi; Orchard, Michael T.; Kanberoğlu, Berkay (IEEE, 2006-07-31)Bu bildiride, eşdalgacıklı tam geri çatma süzgeç öbekleri tasarlamak için, Parks-McClellan algoritması gibi tekniklerle üretilen enküçük-enbüyük optimal eşdalgacıklı kısıtsız süzgeçleri eşlemlemede kullanılan basit bir ...