Baş, Emine2024-09-172024-09-172023978-625-8254-23-5https://hdl.handle.net/20.500.13091/6228In this study, the Snake Optimizer (SO) algorithm, which has been proposed in recent years, has been examined. The SO is a heuristic algorithm proposed for continuous optimization problems. SO is a heuristic algorithm created by imitating the special mating movements of snakes. In its original paper, SO's performance results for CEC-2017 and engineering design problems were examined. In order to prove the success of a heuristic algorithm, it is necessary to demonstrate its success in different benchmark functions. In this study, the success of SO is demonstrated in IEEE CEC-C06 2019 benchmark functions according to three different population sizes (30, 50, and 100) and three different maximum iteration (500, 1000, and 5000). IEEE CEC-C06 2019 test functions are a set of benchmark functions consisting of ten different single-purpose optimization groups. It is often preferred as a problem function set for comparison of continuous optimization problems. Convergence graphs were drawn according to each population size and its success was demonstrated. Thus, a contribution has been made to the literature by showing SO's results in IEEE CEC-C06 2019 benchmark functions. It provided a source for other heuristic algorithms in comparisons.eninfo:eu-repo/semantics/openAccessSnakeCEC-C06 2019Constrained optimizationConference Object