Journals / Afyon Kocatepe Üniversitesi Fen ve Mühendislik Bilimleri Dergisi / 2023 / Cilt: 23 Sayı: 5

Chaotic Snake Optimizer

KAOTİK YILAN OPTİMİZE EDİCİ

Pages
1122–1141
Publication Date
2023-10-30
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)

As a result of the tests, Chaotic Snake Optimizer has been shown to be a promising, successful, and preferable algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Metaheuristic algorithms provide approximate or optimal solutions for optimization problems in a reasonable time.
📊
Key Findings & Data:In this study, different chaotic maps were integrated into the parameters of the algorithm instead of random number sequences to improve the performance of Snake Optimizer, and Snake Optimizer variants using four different chaotic mappings were proposed.
💡
Conclusion & Impact:As a result of the tests, Chaotic Snake Optimizer has been shown to be a promising, successful, and preferable algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Kaotik haritalar · Yılan optimize edici · Metasezgisel algoritmalar

Abstract

Metaheuristic algorithms provide approximate or optimal solutions for optimization problems in a reasonable time. With this feature, metaheuristic algorithms have become an impressive research area for solving difficult optimization problems. Snake Optimizer is a population-based metaheuristic algorithm inspired by the mating behavior of snakes. In this study, different chaotic maps were integrated into the parameters of the algorithm instead of random number sequences to improve the performance of Snake Optimizer, and Snake Optimizer variants using four different chaotic mappings were proposed. The performances of these proposed variants for eight different chaotic maps were examined on classical and CEC2019 test functions. The results revealed that the proposed algorithms contribute to the improvement of Snake Optimizer performance. In the comparison with the literature, the proposed Chaotic Snake Optimizer algorithm found the best mean values in many functions and took second place among the algorithms. As a result of the tests, Chaotic Snake Optimizer has been shown to be a promising, successful, and preferable algorithm.

Özet

Metasezgisel algoritmalar, optimizasyon problemlerine makul bir sürede yaklaşık veya optimal çözümler sunar. Bu özelliği ile metasezgisel algoritmalar zor optimizasyon problemlerini çözmek için etkileyici bir araştırma alanı haline gelmiştir. Yılan Optimize Edici, yılanların çiftleşme davranışlarından esinlenen popülasyon tabanlı bir metasezgisel algoritmadır. Bu çalışmada, Yılan Optimize Edicinin performansını iyileştirmek için rastgele sayı dizileri yerine algoritmanın parametrelerine farklı kaotik haritalar entegre edilmiş ve dört farklı kaotik haritalama kullanılarak Yılan Optimize Edici varyantları önerilmiştir. Önerilen bu varyantların sekiz farklı kaotik harita için performansları klasik ve CEC2019 test fonksiyonları üzerinde incelenmiştir. Sonuçlar, önerilen algoritmaların Yılan Optimize Edici performansının iyileştirilmesine katkıda bulunduğunu ortaya koydu. Literatür ile karşılaştırıldığında önerilen Kaotik Optimize Edici algoritması birçok fonksiyonda en iyi ortalama değerleri bulmuş ve algoritmalar arasında ikinci sırada yer almıştır. Yapılan testler sonucunda, Kaotik Yılan Optimize Edicinin gelecek vadeden, başarılı ve tercih edilebilir bir algoritma olduğu görülmüştür.

🔖

Cite This Article

YILDIZDAN, G. (2023). Chaotic Snake Optimizer. Afyon Kocatepe Üniversitesi Fen ve Mühendislik Bilimleri Dergisi, Cilt: 23 Sayı: 5, 1122–1141. https://ajindex.com/articles/970897

📄 Full Text PDF Viewer

📄

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

References (9)

  1. Abd Elaziz, M., Oliva, D., and Xiong, S., 2017. An improved opposition-based sine cosine algorithm for global optimization. Expert Systems with Applications, 90, 484-500.
  2. Alatas, B., Akin, E., and Ozer, A.B., 2009. Chaos embedded particle swarm optimization algorithms. Chaos, Solitons & Fractals, 40, 1715-1734.
  3. Alataş, B., Akın, E., and Özer, A.B., 2007. Kaotik Haritalı Parçacık Sürü Optimizasyon Algoritmaları. In ELECO 2007 5th International Conference on Electrical and Electronics Engineering, Bursa. Arora, S., and Singh, S., 2019. Butterfly optimization algorithm: a novel approach for global optimization. Soft Computing, 23, 715-734.
  4. Bingol, H., and Alatas, B., 2020. Chaos based optics inspired optimization algorithms as global solution search approach. Chaos, Solitons & Fractals, 141, 110434. Cheng, K., Zhang, J., Tian, S., Liu, H., Gong, J., and Xie, Y., 2022. WiFi Localization Algorithm Based on Snake Optimization Algorithm to Optimize BP Neural Network. In 2022 International Conference on Image Processing, Computer Vision and Machine Learning, IEEE, 615-618.
  5. Dai, Y., Pang, J., Li, Z., Li, W., Wang, Q., and Li, S., 2022. Modeling of thermal error electric spindle based on KELM ameliorated by snake optimization. Case Studies in Thermal Engineering, 40, 102504. Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., and Cosar, A., 2019. A survey on new generation metaheuristic algorithms. Computers & Industrial Engineering, 137, 106040. Daliri, A., Asghari, A., Azgomi, H., and Alimoradi, M., 2022. The water optimization algorithm: a novel metaheuristic for solving optimization problems. Applied Intelligence, 52, 17990-18029.
  6. El-Saleh, A. A., Thaher, T., Chantar, H., and Mafarja, M., 2023. Enhanced IoT Based IDS Driven by Binary Snake Optimizer for Feature Selection. In Advances in Model and Data Engineering in the Digitalization Era: MEDI 2022 Short Papers and DETECT 2022
  7. Workshop Papers, Cairo, Egypt, November 21–24, 2022, Proceedings,Springer,29-43.
  8. Fu, H., Shi, H., Xu, Y., and Shao, J., 2022. Research on Gas Outburst Prediction Model Based on Multiple Strategy Fusion Improved Snake Optimization Algorithm With Temporal Convolutional Network. IEEE Access, 10, 117973-117984. García, S., Molina, D., Lozano, M., and Herrera, F., 2009. A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. Journal of Heuristics, 15, 617-644.
  9. Gong, Y., Li, C., Wang,