Cargando…
Squid Game Optimizer (SGO): a novel metaheuristic algorithm
In this paper, Squid Game Optimizer (SGO) is proposed as a novel metaheuristic algorithm inspired by the primary rules of a traditional Korean game. Squid game is a multiplayer game with two primary objectives: attackers aim to complete their goal while teams try to eliminate each other, and it is u...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10066950/ https://www.ncbi.nlm.nih.gov/pubmed/37005455 http://dx.doi.org/10.1038/s41598-023-32465-z |
_version_ | 1785018359004266496 |
---|---|
author | Azizi, Mahdi Baghalzadeh Shishehgarkhaneh, Milad Basiri, Mahla Moehler, Robert C. |
author_facet | Azizi, Mahdi Baghalzadeh Shishehgarkhaneh, Milad Basiri, Mahla Moehler, Robert C. |
author_sort | Azizi, Mahdi |
collection | PubMed |
description | In this paper, Squid Game Optimizer (SGO) is proposed as a novel metaheuristic algorithm inspired by the primary rules of a traditional Korean game. Squid game is a multiplayer game with two primary objectives: attackers aim to complete their goal while teams try to eliminate each other, and it is usually played on large, open fields with no set guidelines for size and dimensions. The playfield for this game is often shaped like a squid and, according to historical context, appears to be around half the size of a standard basketball court. The mathematical model of this algorithm is developed based on a population of solution candidates with a random initialization process in the first stage. The solution candidates are divided into two groups of offensive and defensive players while the offensive player goes among the defensive players to start a fight which is modeled through a random movement toward the defensive players. By considering the winning states of the players of both sides which is calculated based on the objective function, the position updating process is conducted and the new position vectors are produced. To evaluate the effectiveness of the proposed SGO algorithm, 25 unconstrained mathematical test functions with 100 dimensions are used, alongside six other commonly used metaheuristics for comparison. 100 independent optimization runs are conducted for both SGO and the other algorithms with a pre-determined stopping condition to ensure statistical significance of the results. Statistical metrics such as mean, standard deviation, and mean of required objective function evaluations are calculated. To provide a more comprehensive analysis, four prominent statistical tests including the Kolmogorov–Smirnov, Mann–Whitney, and Kruskal–Wallis tests are used. Meanwhile, the ability of the suggested SGOA is assessed through the cutting-edge real-world problems on the newest CEC like CEC 2020, while the SGO demonstrate outstanding performance in dealing with these complex optimization problems. The overall assessment of the SGO indicates that the proposed algorithm can provide competitive and remarkable outcomes in both benchmark and real-world problems. |
format | Online Article Text |
id | pubmed-10066950 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-100669502023-04-03 Squid Game Optimizer (SGO): a novel metaheuristic algorithm Azizi, Mahdi Baghalzadeh Shishehgarkhaneh, Milad Basiri, Mahla Moehler, Robert C. Sci Rep Article In this paper, Squid Game Optimizer (SGO) is proposed as a novel metaheuristic algorithm inspired by the primary rules of a traditional Korean game. Squid game is a multiplayer game with two primary objectives: attackers aim to complete their goal while teams try to eliminate each other, and it is usually played on large, open fields with no set guidelines for size and dimensions. The playfield for this game is often shaped like a squid and, according to historical context, appears to be around half the size of a standard basketball court. The mathematical model of this algorithm is developed based on a population of solution candidates with a random initialization process in the first stage. The solution candidates are divided into two groups of offensive and defensive players while the offensive player goes among the defensive players to start a fight which is modeled through a random movement toward the defensive players. By considering the winning states of the players of both sides which is calculated based on the objective function, the position updating process is conducted and the new position vectors are produced. To evaluate the effectiveness of the proposed SGO algorithm, 25 unconstrained mathematical test functions with 100 dimensions are used, alongside six other commonly used metaheuristics for comparison. 100 independent optimization runs are conducted for both SGO and the other algorithms with a pre-determined stopping condition to ensure statistical significance of the results. Statistical metrics such as mean, standard deviation, and mean of required objective function evaluations are calculated. To provide a more comprehensive analysis, four prominent statistical tests including the Kolmogorov–Smirnov, Mann–Whitney, and Kruskal–Wallis tests are used. Meanwhile, the ability of the suggested SGOA is assessed through the cutting-edge real-world problems on the newest CEC like CEC 2020, while the SGO demonstrate outstanding performance in dealing with these complex optimization problems. The overall assessment of the SGO indicates that the proposed algorithm can provide competitive and remarkable outcomes in both benchmark and real-world problems. Nature Publishing Group UK 2023-04-01 /pmc/articles/PMC10066950/ /pubmed/37005455 http://dx.doi.org/10.1038/s41598-023-32465-z Text en © The Author(s) 2023 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Article Azizi, Mahdi Baghalzadeh Shishehgarkhaneh, Milad Basiri, Mahla Moehler, Robert C. Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title | Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title_full | Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title_fullStr | Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title_full_unstemmed | Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title_short | Squid Game Optimizer (SGO): a novel metaheuristic algorithm |
title_sort | squid game optimizer (sgo): a novel metaheuristic algorithm |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10066950/ https://www.ncbi.nlm.nih.gov/pubmed/37005455 http://dx.doi.org/10.1038/s41598-023-32465-z |
work_keys_str_mv | AT azizimahdi squidgameoptimizersgoanovelmetaheuristicalgorithm AT baghalzadehshishehgarkhanehmilad squidgameoptimizersgoanovelmetaheuristicalgorithm AT basirimahla squidgameoptimizersgoanovelmetaheuristicalgorithm AT moehlerrobertc squidgameoptimizersgoanovelmetaheuristicalgorithm |