Journals / Konya Mühendislik Bilimleri Dergisi / 2023 / Cilt: 11 Sayı: 2

Bin_MRFOA: A NOVEL MANTA RAY FORAGING OPTIMIZATION ALGORITHM FOR BINARY OPTIMIZATION

BIN_MRFOA: İkili Optimizasyon İçin Yeni Bir Manta Vatozu Beslenme Optimizasyonu Algoritması

Pages
449–467
Publication Date
2023-06-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results revealed that Bin_MRFOA is a successful, competitive, and preferable algorithm compared to the literature.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Optimization problems occur in three different structures: continuous, discrete, and hybrid.
📊
Key Findings & Data:The Bin_MRFOA was first tested on ten classical benchmark functions, and the effect of the transfer function on performance was examined by comparing the variants obtained using eight different transfer functions.
💡
Conclusion & Impact:The results revealed that Bin_MRFOA is a successful, competitive, and preferable algorithm compared to the literature.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:İkili optimizasyon · Manta vatozu beslenme optimizasyonu · S-şekilli ve V-şekilli transfer fonksiyonları

Abstract

Optimization problems occur in three different structures: continuous, discrete, and hybrid. Metaheuristic algorithms, which are frequently preferred in the solution of optimization problems today, are mostly proposed for continuous problems and are discretized with subsequent modifications. In this study, a novel binary version (Bin_MRFOA) of the manta ray foraging optimization algorithm, which was frequently used in the solution of continuous optimization problems before, was proposed to be used in the solution of binary optimization problems. The Bin_MRFOA was first tested on ten classical benchmark functions, and the effect of the transfer function on performance was examined by comparing the variants obtained using eight different transfer functions. Then the most successful Bin_MRFOA variant was run on the eighteen CEC2005 benchmark functions. The results were compared with the algorithms in the literature and interpreted with Wilcoxon signed-rank and Friedman tests, which are nonparametric tests. The results revealed that Bin_MRFOA is a successful, competitive, and preferable algorithm compared to the literature.

Özet

Optimizasyon problemleri üç farklı yapıda ortaya çıkar: sürekli, ayrık ve hibrit. Günümüzde optimizasyon problemlerinin çözümünde sıklıkla tercih edilen metasezgisel algoritmalar daha çok sürekli problemler için önerilmiş ve sonraki modifikasyonlarla ayrıklaştırılmıştır. Bu çalışmada, daha önce sürekli optimizasyon problemlerinin çözümünde sıklıkla kullanılan manta vatozu beslenme optimizasyon algoritmasının yeni bir ikili versiyonu (Bin_MRFOA), ikili optimizasyon problemlerinin çözümünde kullanılmak üzere önerilmiştir. Bin_MRFOA ilk olarak on tane klasik kıyaslama fonksiyon üzerinde test edilmiş ve sekiz farklı transfer fonksiyonu kullanılarak elde edilen varyantlar karşılaştırılarak transfer fonksiyonunun performans üzerindeki etkisi incelenmiştir. Ardından en başarılı Bin_MRFOA varyantı, on sekiz CEC2005 kıyaslama fonksiyonu üzerinde çalıştırılmıştır. Sonuçlar literatürdeki algoritmalar ile karşılaştırılmış ve parametrik olmayan Friedman testi ile yorumlanmıştır. Sonuçlar, Bin_MRFOA'nın literatüre kıyasla başarılı, rekabetçi ve tercih edilebilir bir algoritma olduğunu ortaya koymuştur.

🔖

Cite This Article

YILDIZDAN, G. (2023). Bin_MRFOA: A NOVEL MANTA RAY FORAGING OPTIMIZATION ALGORITHM FOR BINARY OPTIMIZATION. Konya Mühendislik Bilimleri Dergisi, Cilt: 11 Sayı: 2, 449–467. https://ajindex.com/articles/938460

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  1. R. M. Rizk-Allah, "Hybridizing sine cosine algorithm with multi-orthogonal search strategy for engineering design problems," Journal of Computational Design and Engineering, vol. 5, no. 2, pp. 249-273, 2018
  2. S. Korkmaz, A. Babalik, and M. S. Kiran, "An artificial algae algorithm for solving binary optimization problems," International Journal of Machine Learning and Cybernetics, vol. 9, no. 7, pp. 1233-1247, 2018
  3. J. Wang, M. Khishe, M. Kaveh, and H. Mohammadi, "Binary Chimp Optimization Algorithm (BChOA): a New Binary Meta-heuristic for Solving Optimization Problems," Cognitive Computation, vol. 13, no. 5, pp. 1297-1316, 2021
  4. Q. Al-Tashi, S. J. A. Kadir, H. M. Rais, S. Mirjalili, and H. Alhussian, "Binary optimization using hybrid grey wolf optimization for feature selection," Ieee Access, vol. 7, pp. 39496-39508, 2019
  5. E. Baş and E. Ülker, "A binary social spider algorithm for continuous optimization task," Soft Computing, vol. 24, no. 17, pp. 12953-12979, 2020
  6. M. Aslan, M. Gunduz, and M. S. Kiran, "JayaX: Jaya algorithm with xor operator for binary optimization," Applied Soft Computing, vol. 82, p. 105576, 2019
  7. A. G. Hussien, A. E. Hassanien, E. H. Houssein, M. Amin, and A. T. Azar, "New binary whale optimization algorithm for discrete optimization problems," Engineering Optimization, vol. 52, no. 6, pp. 945-959, 2020
  8. A. C. Cinar and M. S. Kiran, "Similarity and logic gate-based tree-seed algorithms for binary optimization," Computers & Industrial Engineering, vol. 115, pp. 631-646, 2018
  9. R. M. Rizk-Allah, A. E. Hassanien, M. Elhoseny, and M. Gunasekaran, "A new binary salp swarm algorithm: development and application for optimization tasks," Neural Computing and Applications, vol. 31, no. 5, pp. 1641-1663, 2019
  10. S. Arora and P. Anand, "Binary butterfly optimization approaches for feature selection," Expert Systems with Applications, vol. 116, pp. 147-160, 2019
  11. M. Mafarja et al., "Binary dragonfly optimization for feature selection using time-varying transfer functions," Knowledge-Based Systems, vol. 161, pp. 185-204, 2018
  12. T. Akan, S. Agahian, and R. Dehkharghani, "Binbro: Binary battle royale optimizer algorithm," Expert Systems with Applications, vol. 195, p. 116599, 2022
  13. M. Abdel-Basset, R. Mohamed, R. K. Chakrabortty, M. Ryan, and S. Mirjalili, "New binary marine predators optimization algorithms for 0–1 knapsack problems," Computers & Industrial Engineering, vol. 151, p. 106949, 2021. [