A Comprehensive Study of Parameters Analysis for Galactic Swarm Optimization
Loading...
Date
2021
Authors
Kaya, Ersin
Journal Title
Journal ISSN
Volume Title
Publisher
Ismail Saritas
Open Access Color
GOLD
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
The galactic swarm optimization algorithm is a metaheuristic approach inspired by the motion and behavior of stars and galaxies. It is a framework that can use basic metaheuristic search methods. The method, which has a two-phase structure, performs exploration in the first phase and exploitation in the second phase. GSO tries to find the best solution in the search space by repeating these two phases for the specified number of times. In this study, the analysis of maximum epoch number (EPmax), the number of iterations in the first phase (L1), and the number of iterations in the second phase (L2) parameters, which determine the exploration and exploitation balance in the GSO method, was performed. 15 different parameter sets consisting of different values of these three parameters were created. The methods with 15 different parameter sets were performed at 30 independent runs. The methods were analyzed using 26 benchmark functions. The functions are tested in 30, 60, and 100 dimensions. Detailed results of the analysis were presented in the study, and the results obtained were also evaluated statistically. © 2021, Ismail Saritas. All rights reserved.
Description
Keywords
Galactic swarm optimization, Metaheuristic optimization algorithm, Parameter analysis, parameter analysis, galactic swarm optimization, metaheuristic optimization algorithm
Turkish CoHE Thesis Center URL
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
N/A
Scopus Q
Q4

OpenCitations Citation Count
3
Source
International Journal of Intelligent Systems and Applications in Engineering
Volume
9
Issue
1
Start Page
28
End Page
37
PlumX Metrics
Citations
CrossRef : 1
Scopus : 4
Captures
Mendeley Readers : 1
SCOPUS™ Citations
4
checked on Feb 03, 2026
Google Scholar™


