- Zeki Sistemler Teori ve Uygulamaları Dergisi
- Cilt: 6 Sayı: 2
- Binary Honey Badger Algorithm for 0-1 Knapsack Problem
Binary Honey Badger Algorithm for 0-1 Knapsack Problem
Authors : Gülşen Orucova Büyüköz, Hüseyin Hakli
Pages : 108-118
Doi:10.38016/jista.1200225
View : 81 | Download : 68
Publication Date : 2023-09-23
Article Type : Research
Abstract :Honey Badger Algorithm (HBA) is one of the recently proposed optimization techniques inspired by the foraging behavior of honey badger. Although it has been successfully applied in solving continuous problems, the algorithm cannot be implemented directly in binary problems. A binary version of HBA is proposed in this study for the 0-1 Knapsack Problem (0-1 KP). To adapt the binary version of HBA, V- Shaped, S-Shaped, U-Shaped, T-Shaped, Tangent Sigmoid, O-Shaped, and Z-Shaped transfer functions are used. Each transfer function was tested by computational experiments over 25 instances of 0-1 KP and compared results. According to the results obtained, it was observed that O1 was the best TF among 25 TFs. In addition, the proposed algorithm was compared with three different binary variants, such as BPSO, MBPSO, and NGHS. Experimental results and comparison show that the proposed method is a promising and alternative algorithm for 0-1 KP problems.Keywords : İkili Bal Porsuğu Algoritması, 0-1 Sırt Çantası Problemleri, Transfer Fonksiyonları, İkili Optimizasyon