Journals / Düzce Üniversitesi Bilim ve Teknoloji Dergisi / 2020 / Cilt: 8 - Sayı: 3

Chaos Based Gravitational Search Algorithms (CbGSA-X) for Benchmark Functions

Test Fonksiyonları için Kaos Tabanlı Yerçekimsel Arama Algoritmaları (CbGSA-X)

Pages
1771–1793
Publication Date
2022-10-12
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)

Finally we introduce our solutions and performed evaluations.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The heuristic algorithms used in the solution of optimization problems may not be able to reach the best result for each problem resolutely due to their different designs.
📊
Key Findings & Data:Within this scope, we evaluated the performance of gravitational search algorithm (GSA), which is one of the most prominent heuristic algorithm.
💡
Conclusion & Impact:Finally we introduce our solutions and performed evaluations.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Optimizasyon · Sezgisel algoritmalar · Yerçekimsel arama algoritması

Abstract

The heuristic algorithms used in the solution of optimization problems may not be able to reach the best result for each problem resolutely due to their different designs. As a consequence, literature denotes some developing structures which are added to these heuristic algorithms. Within this scope, we evaluated the performance of gravitational search algorithm (GSA), which is one of the most prominent heuristic algorithm. In the study, aiming to increase the convergence speed of the algorithm, a new algorithm has been created by integrating some chaotic mapping methods to GSA. This new algorithm has been called chaos-based gravitational search algorithm (CbGSA-X). In order to make a performance evaluation for each mapping method, we utilized test functions which were solved with GSA in literature. Finally we introduce our solutions and performed evaluations.

Özet

Optimizasyon problemlerinin çözümünde kullanılan sezgisel algoritmalar farklı tasarımlarından dolayı, her problem için en iyi sonuca kararlı bir şekilde ulaşamayabilir. Bu nedenle literatürde bu sezgisel algoritmalara bazı geliştirici yapıların eklendiği çalışmalara sıklıkla rastlanmaktadır. Benzer şekilde bu çalışmada sezgisel algoritmalardan biri olan yerçekimsel arama algoritmasının (GSA) performansının geliştirilmesine çalışılmıştır. Çalışmada algoritmanın yakınsama hızının artırılması amaçlanarak GSA’ya bazı kaotik haritalama metotları entegre edilerek, yeni bir algoritma ortaya çıkartılmıştır. Bu yeni algoritmaya Kaos tabanlı yerçekimsel arama algoritması (CbGSA-X) adı verilmiştir. Çalışmada CbGSA-X’deki ilk popülasyondaki ajanlar oluşturulurken ilk ajan arama uzayında rastgele konumlandırılırken, diğer ajanlar ise bu ajana bağlı olarak 5 farklı (X=1, 2, 3, 4, 5) kaotik haritalama yöntemi kullanılarak konumlandırılmıştır. Her haritalama metodu için performans değerlendirilmesi yapılabilmesi için literatürde GSA ile çözümü yer alan test fonksiyonları ele alınmış ve çözümü yapılarak sonuçlar değerlendirilmiştir.

🔖

Cite This Article

TEMURTAŞ, H., ÖZYÖN, S., YAŞAR, C. (2022). Chaos Based Gravitational Search Algorithms (CbGSA-X) for Benchmark Functions. Düzce Üniversitesi Bilim ve Teknoloji Dergisi, Cilt: 8 - Sayı: 3, 1771–1793. https://ajindex.com/articles/494245

📄 Full Text PDF Viewer

📄

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

References (17)

  1. E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, “GSA: A gravitational search algorithm,” Information Sciences, c. 179, s. 13, ss. 2232-2248, 2009
  2. U. Güvenç, F. Katırcıoğlu, “En İyi Ajana Özel Davranış: Geliştirilmiş Yerçekimi Arama Algoritması,” El-Cezeri Jounal of Science and Engineering, c. 3, s. 1, ss. 143-153, 2016
  3. A. Kaveh, VR. Mahdavi, “Colliding bodies optimization: A novel meta‐heuristic method,” Computers and Structures, c. 139, ss. 18-27, 2014
  4. OK. Erol, I. Eksin, “A new optimization method: Big Bang–Big Crunch,” Advances in Engineering Software, c. 37, s. 2, ss. 106-111, 2006
  5. A. Hatamlou, “Black hole: A new heuristic optimization approach for data clustering,” Information Sciences, c. 222, ss. 175-184, 2013
  6. S. Kirkpatrick, CD. Gelatt, MP. Vecchi, “Optimisation by simulated annealing,” Science, c. 220, ss. 671-680, 1983
  7. DE. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine Learning,” Addison-Wesley Publishing Company, Inc.,1989
  8. R. Storn, K. Price, “Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, c. 11, ss. 341-359, 1997
  9. Aİ. Çanakoğlu, AG. Yetgin, H. Temurtaş, M. Turan, “Induction motor parameter estimation using metaheuristic methods,” Turkish Journal of Electrical Engineering & Computer Sciences, c. 22, ss. 1177-1192, 2014
  10. J. Kennedy, R. Eberhart, “Particle Swarm Optimization,” Proceedings of IEEE International Conference on Neural Networks, c. 4, ss. 1942-1948, 1995
  11. ZW. Geem, JH. Kim, GV. Loganathan, “A new heuristic optimization algorithm: Harmony search,” Simulation, c. 76, s. 2, ss. 60-68, 2001
  12. D. Karaboğa, B. Baştürk, “A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm,” Journal of Global Optimization, c. 39, s. 3, ss. 459-471, 2007
  13. A. Kaveh, S. Talahatari, “A novel heuristic optimization method: Charged system search,” Acta Mechanica, c. 213, s. 3-4, ss. 267-289, 2010
  14. YJ. Zheng, “Water wave optimization: A new nature-inspired metaheuristic,” Computers and Operations Research, c. 55, ss. 1-11, 2015
  15. S. Mirjalili, A. Lewis, “The whale optimization algorithm,” Advances in Engineering Software, c. 95, ss. 51-67, 2016
  16. R. Rajabioun, “Cuckoo optimization algorithm,” Applied Soft Computing, c. 11, ss. 5508-5518, 2011
  17. A. Askarzadeh, “A novel metaheuristic method for solving constrained engineering o