Research Article

Spider Wasp Optimization Algorithm

Volume: 9 Number: 1 June 30, 2025
TR EN

Spider Wasp Optimization Algorithm

Abstract

This study aims to improve the performance of the Spider Wasp Optimization (SWO) algorithm, a swarm intelligence algorithm recently introduced in the literature, on various test functions with fixed and variable dimensions. Optimization can be defined as making a system as efficient as possible with minimal cost within certain constraints. Numerous optimization algorithms have been designed in the literature and used to obtain the best solutions for specific problems. The most critical aspects in solving these problems include correctly modeling the problem, determining the problem’s parameters and constraints, and finally selecting an appropriate meta-heuristic algorithm to solve the objective function. Not every algorithm is suitable for every problem structure. Some algorithms perform better on fixed-dimension test functions, while others in solving variable-dimension test functions. In this study, the performance of the SWO algorithm was evaluated on 10 test functions previously used in the literature, consisting of three fixed-dimension functions (Schaffer, Himmelblau and Kowalik Functions) and seven variable-dimension functions, including one unimodal function (Elliptic Function) and six multimodal functions (Non-Continuous Rastrigin, Alpine, Levy, Weierstrass, Michalewicz, and Dixon & Price Functions). The solution values obtained for each of the selected functions were compared with the solutions obtained using the Harris Hawks Optimizer (HHO), the Charged System Search (CSS), and the Backtracking Search Optimization Algorithm (BSA).

Keywords

References

  1. F. Cantaş, S. Özyön, and C. Yaşar, “Runge Kutta Optimization for Fixed Size Multimodal Test Functions,” International Scientific and Vocational Studies Journal, vol. 6, no. 2, pp. 144-155, 2022. DOI: 10.47897/bilmes.1219033.
  2. S. M. Öztürk and A. Çifci, “A Study in Enhancing Battery Management Systems for Diverse Battery Types,” International Scientific and Vocational Studies Journal, vol. 7, no. 2, pp. 122-136, 2023. DOI: 10.47897/bilmes.1385510.
  3. T. Aktaş, İ. M. Temel, and A. Saygılı, “Comparative Analysis of Diabetes Diagnosis with Machine Learning Methods,” International Scientific and Vocational Studies Journal, vol. 8, no. 1, pp. 22-32, 2024. DOI: 10.47897/bilmes.1447878.
  4. A. İ. Çanakoğlu, “Monte Carlo Increased-Radius Floating Random Walk Solution For Potential Problems,” International Scientific and Vocational Studies Journal, vol. 8, no. 1, pp. 13-21, 2024. DOI: 10.47897/bilmes.1441414.
  5. K. Gencer, G. Gencer, and İ. H. Cizmeci, “Deep Learning Approaches for Retinal Image Classification: A Comparative Study of GoogLeNet and ResNet Architectures,” International Scientific and Vocational Studies Journal, vol. 8, no. 2, pp. 123-128, 2024. DOI: 10.47897/bilmes.1523768.
  6. U. Saray and U. Çavdar, “Comparison of Different Optimization Algorithms in the Fashion MNIST Dataset,” International Journal of Multidisciplinary Studies and Innovative Technologies (IJMSIT), vol. 8, no. 2, pp. 52-58, 2024.
  7. M. D. Demirbaş and D. Çakır (Sofuoğlu), “Evaluation of the Performance of ANN Algorithms with the Bidirectional Functionally Graded Circular Plate Problem,” International Scientific and Vocational Studies Journal (ISVOS), vol. 6, no. 2, pp. 103-115, 2022. DOI: 10.47897/bilmes.1207256.
  8. M. Lüy and N. A. Metin, “PID Control Medium Size Wind Turbine Control with Integrated Blade Pitch Angle,” International Scientific and Vocational Studies Journal (ISVOS), vol. 6, no. 1, pp. 22-31, 2022. DOI: 10.47897/bilmes.1091968.

Details

Primary Language

Turkish

Subjects

Distributed Systems and Algorithms, Satisfiability and Optimisation

Journal Section

Research Article

Publication Date

June 30, 2025

Submission Date

March 17, 2025

Acceptance Date

April 30, 2025

Published in Issue

Year 2025 Volume: 9 Number: 1

APA
Karataş, O., Yaşar, C., Temurtaş, H., & Özyön, S. (2025). Spider Wasp Optimization Algorithm. International Scientific and Vocational Studies Journal, 9(1), 42-67. https://doi.org/10.47897/bilmes.1659488
AMA
1.Karataş O, Yaşar C, Temurtaş H, Özyön S. Spider Wasp Optimization Algorithm. ISVOS. 2025;9(1):42-67. doi:10.47897/bilmes.1659488
Chicago
Karataş, Osman, Celal Yaşar, Hasan Temurtaş, and Serdar Özyön. 2025. “Spider Wasp Optimization Algorithm”. International Scientific and Vocational Studies Journal 9 (1): 42-67. https://doi.org/10.47897/bilmes.1659488.
EndNote
Karataş O, Yaşar C, Temurtaş H, Özyön S (June 1, 2025) Spider Wasp Optimization Algorithm. International Scientific and Vocational Studies Journal 9 1 42–67.
IEEE
[1]O. Karataş, C. Yaşar, H. Temurtaş, and S. Özyön, “Spider Wasp Optimization Algorithm”, ISVOS, vol. 9, no. 1, pp. 42–67, June 2025, doi: 10.47897/bilmes.1659488.
ISNAD
Karataş, Osman - Yaşar, Celal - Temurtaş, Hasan - Özyön, Serdar. “Spider Wasp Optimization Algorithm”. International Scientific and Vocational Studies Journal 9/1 (June 1, 2025): 42-67. https://doi.org/10.47897/bilmes.1659488.
JAMA
1.Karataş O, Yaşar C, Temurtaş H, Özyön S. Spider Wasp Optimization Algorithm. ISVOS. 2025;9:42–67.
MLA
Karataş, Osman, et al. “Spider Wasp Optimization Algorithm”. International Scientific and Vocational Studies Journal, vol. 9, no. 1, June 2025, pp. 42-67, doi:10.47897/bilmes.1659488.
Vancouver
1.Osman Karataş, Celal Yaşar, Hasan Temurtaş, Serdar Özyön. Spider Wasp Optimization Algorithm. ISVOS. 2025 Jun. 1;9(1):42-67. doi:10.47897/bilmes.1659488


Creative Commons Lisansı


Creative Commons Atıf 4.0 It is licensed under an International License