A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0-1 knapsack problems

Basit Öğe Kaydı
dc.contributor.authorErvural, Bilal
dc.contributor.authorHakli, Huseyin
dc.date.accessioned2024-02-23T14:02:26Z
dc.date.available2024-02-23T14:02:26Z
dc.date.issued2023
dc.departmentNEÜen_US
dc.description.abstractThe Reptile Search Algorithm (RSA), inspired by crocodiles' hunting behavior, is a recently introduced nature -inspired algorithm. Although the original version of the RSA shows outstanding performance in optimizing continuous applications, it is not suitable for discrete optimization problems like 0-1 knapsack problems (0-1 KP). To extend RSA to binary optimization issues, binary RSA (BinRSA) is proposed in this study. A wide range of transfer functions (TFs), including the largely used s-shaped and v-shaped, and recently introduced z-shaped, u -shaped, and taper-shaped, are investigated in the proposed algorithm to map the continuous values into binary. In addition, a novel repair method is introduced to cope with infeasible solutions for 0-1 KP and discussed in detail regarding its efficacy in reaching the optimal solution. The proposed method is validated on three benchmark datasets with 63 instances of 0-1 KP. First, the impact of 25 different transfer functions under six categories on the performance of the proposed binary algorithm is thoroughly investigated, and the results indicate that the taper-shaped T1 transfer function is superior to the other variants of the BinRSA. Then, the effectiveness of the proposed BinRSA with T1 transfer function is compared with some well-known and state-of -art algorithms, including Harris hawks optimization (HHO), slime mould algorithm (SMA), and marine predators algorithm (MPA). The experimental results show that compared to other methods, BinRSA considerably increased the solution accuracy and robustness for solving 0-1 KP.en_US
dc.identifier.doi10.1016/j.cie.2023.109080
dc.identifier.issn0360-8352
dc.identifier.issn1879-0550
dc.identifier.scopus2-s2.0-85149334937en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.cie.2023.109080
dc.identifier.urihttps://hdl.handle.net/20.500.12452/11714
dc.identifier.volume178en_US
dc.identifier.wosWOS:000955895700001en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.ispartofComputers & Industrial Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectReptile Search Algorithmen_US
dc.subjectKnapsack Problemsen_US
dc.subjectBinary Optimizationen_US
dc.subjectRepair Methoden_US
dc.subjectTransfer Functionsen_US
dc.titleA binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0-1 knapsack problemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu