Yeni önerilmiş ikili fare sürüsü algoritması

Öz

Son zamanlarda araştırmacılar, basit yapısı, yüksek optimizasyon performansı ve adaptasyon kolaylığı nedeniyle optimizasyonda sürü tabanlı algoritmalara ilgi duymaya başlamışlardır. Sürü tabanlı algoritmalar, her ne kadar sürekli optimizasyon problemlerini çözmek için kullanılsalar da ikili optimizasyon problemlerini çözmek için de kullanılabilirler. Sürekli optimizasyonda arama uzayı değişkenleri optimal değere yaklaşmaya çalışırken, ayrık optimizasyonda arama uzayı değişkenleri sabittir ve gerçek değerlerle ifade edilir. İkili optimizasyon ise, karar değişkenleri 0 ve 1 değerleri alır ve temel olarak ayrık optimizasyon sınıfında yer alır. Bu makalede sürekli optimizasyon problemlerini çözmek için önerilmiş Fare Sürüsü Algoritması (FSA) incelenmiştir. FSA, sürü zekâsına dayalı bir algoritmadır. Farelerin kovalama ve saldırma davranışları taklit edilerek FSA geliştirilmiştir. Bu çalışmada, orijinal FSA, ikili optimizasyon problemlerini çözmek için tekrar güncellenmiştir ve İkili FSA (BinFSA) önerilmiştir. BinFSA’da sürekli arama alanı değerlerini ikili değerlere dönüştürürken dört adet U ve dört adet T şekilli transfer işlevi kullanılmıştır. Böylece BinFSA'nın sekiz varyantı elde edilmiştir. Bunlar BinFSA1, BinFSA2, BinFSA3, BinFSA4, BinFSA5, BinFSA6, BinFSA7 ve BinFSA8 şeklinde isimlendirilmişlerdir. Bu varyantlar içinden BinFSA'nın en başarılı varyantı BinFSA6 olarak belirlenmiştir. Daha sonra BinFSA6 varyantı, çaprazlama ve mutasyon operatörleri eklenerek geliştirilmiştir ve GBinFSA olarak adlandırılmıştır. GBinFSA’nın performansı sırt çantası problemlerinde test edilmiştir. Ayrıca GBinFSA'nın başarısı literatürden seçilen farklı sezgisel algoritmalarla da karşılaştırılmıştır. Elde edilen sonuçlara göre önerilen algoritmanın çözüm kalitesinin etkili ve karşılaştırılabilir olduğu görülmüştür. Sonuçlar, GBinFSA'nın ikili optimizasyon problemleri için tercih edilen bir buluşsal algoritma olduğunu göstermiştir.

Anahtar Kelimeler

• FSA
• İkili optimizasyon
• Fare
• Çaprazlama
• Mutasyon

The new suggested binary rat swarm algorithm

Abstract

Recently, researchers have started to be interested in population-based swarm-based algorithms in optimization due to their simple structure, high optimization performance, and ease of adaptation. Although swarm-based algorithms solve continuous optimization problems, they can also be used to solve binary optimization problems. In continuous optimization, the search space variables try to approach the optimal value, while in discrete optimization, the search space variables are fixed and expressed with real values. In binary optimization, the decision variables take values of 0 and 1 and are basically in the discrete optimization class. In this paper, the proposed Rat Swarm Algorithm (RSA) to solve continuous optimization problems is examined. RSA is an algorithm based on swarm intelligence. RSA was developed by imitating the chasing and attacking behaviors of rats. In this study, the original RSA was updated again to solve binary optimization problems and Binary RSA (BinRSA) was proposed. In BinRSA, four U-shaped and four T-shaped transfer functions are used while converting the continuous search field values to binary values. Thus, eight variants of BinRSA were obtained. These are named as BinRSA1, BinRSA2, BinRSA3, BinRSA4, BinRSA5, BinRSA6, BinRSA7 and BinRSA8. Among these variants, the most successful variant of BinRSA was determined as BinRSA6. Then the BinRSA6 variant was developed by adding crossover and mutation operators and was named GBinRSA. GBinRSA's performance has been tested in knapsack problems. In addition, the success of GBinRSA was compared with different heuristic algorithms selected from the literature. According to the results obtained, it has been seen that the solution quality of the proposed algorithm is effective and comparable. The results showed that GBinRSA is a preferred heuristic for binary optimization problems.

Keywords

• RSA
• Binary optimization
• Rat
• Crossover
• Mutation

Kaynakça

1. [1] Hajipour V, Mehdizadeh E, Tavakkoli-Moghaddam R. “A novel Pareto-based multi-objective vibration-damping optimization algorithm to solve multi-objective optimization problems”. Scientia Iranica Transaction Industrial Engineering, 21(6), 2368-2378, 2014.
2. [2] Lim SM, Sulta AB, Sulaiman N, Mustapha A, Leong KY. “Crossover and mutation operators of genetic algorithms”. International Journal of Machine Learning and Computing, 7(1), 9-12, 2017.
3. [3] Patil VP, Pawar DD. “The optimal crossover or mutation rates in genetic algorithm: a review”. International Journal of Applied Engineering and Technology, 5(3), 38-41, 2015.
4. [4] Dhiman G, Garg M, Nager A, Kumar V, Dehghani M. “A novel algorithm for global optimization: rat swarm optimizer”. Journal of Ambient Intelligence and Humanized Computing, 12, 8457–8482, 2021.
5. [5] He H, Zhanga F, Mirjalili S, Zhanga T. “Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems”. Swarm and Evolutionary Computation, 69(2022), 1-15, 2022.
6. [6] Kulkarni AJ, Shabir H. “Solving 0–1 knapsack problem using cohort ıntelligence algorithm”. International Journal of Machine Learning and Cybernetics, 7(2016), 427–441, 2016.
7. [7] Bansal JC, Deep K. “A modified binary particle swarm optimization for knapsack problems”. Applied Mathematics and Computation, 218(22), 11042–11061, 2012.
8. [8] Eberhart R, Kennedy J. “Particle swarm optimization”. Proceedings of ICNN'95-International Conference on Neural Networks, Perth, Australia, 27 November-1 December 1995.

9. [9] Haklı H. “BinEHO: a new binary variant based on elephant herding optimization algorithm”. Neural Computing and Applications, 32(2020), 16971-16991, 2020.
10. [10] Donald L. Kreher’s Personel Web Pages. “The Random Instances of Problem (0,1)”. https://pages.mtu.edu/~kreher/cages/Data.html (01.03.2022).
11. [11] Johny A. Ortega R. (Jao Ruiz)’s Personel Web Pages. “Instances of 0/1 Knapsack Problem”. http://artemisa.unicauca.edu.co/~johnyortega/instance s_01_KP/ (03.03.2022).
12. [12] Kennedy J, Eberhart RC. “A discrete binary version of the particle swarm algorithm”. SMC 97 Conference Proceedings-1997 Leee International Conference on Systems, Man, and Cybernetics, Orlando, USA, 12-15 October 1997.
13. [13] Mirjalili S, Lewis A. “The whale optimization algorithm”. Advances in Engineering Software, 95(2016), 51-67, 2016.
14. [14] Yang XS. A New Metaheuristic Bat-Inspired Algorithm. Editors: González JR, Pelta DA, Cruz C, Terrazas G, Krasnogor N. Nature Inspired Cooperative Strategies for Optimization, 65-74, Berlin, Heidelberg, Springer, 2010.
15. [15] Xiang WL, An MQ, Li YZ, He RC, Zhang JF. “A novel discrete global-best harmony search algorithm for solving 0–1 knapsack problems”. Discrete Dynamics in Nature and Society, 2014, 1-12, 2014.
16. [16] Wu H, Zhou Y, Luo Q. “The hybrid symbiotic organisms search algorithm for solving 0–1 knapsack problem”. International Journal of Bio-Inspired Computation, 12(1), 23–53, 2018.
17. [17] Zou DX, Gao LQ, Li S, Wu JH. “Solving 0–1 knapsack problem by a novel global harmony search algorithm”. Apply Soft Computing, 11(2), 1556-1564, 2011.
18. [18] Zhou Y, Li L, Ma M. “A complex-valued encoding bat algorithm for solving 0–1 knapsack problem”. Neural Processing Letters, 44(2), 407-430, 2016.
19. [19] Baş E, Ülker E. “A binary social spider algorithm for uncapacitated facility location problem”. Expert Systems with Applications, 161(2020), 1-27, 2020.
20. [20] Akyol S, Alatas B. “Plant intelligence based metaheuristic optimization algorithms”. Artificial Intelligence Review, 47(2017), 417-462, 2017.
21. [21] Alatas B, Bingol H. “Comparative assessment of lightbased intelligent search and optimization algorithms”. Light & Engineering, 28(6), 51-59, 2020.