The problem of the genetic algorithm initial configuration selection
URI (для ссылок/цитирований):
http://sib-publish.ru/?tech12&ruhttps://elib.sfu-kras.ru/handle/2311/128777
Автор:
N, A Timofeev
P, V Peresunko
S, R Nekhonoshin
V, V Kukartsev
V, V Tynchenko
A, S Mikhalev
Коллективный автор:
Институт космических и информационных технологий
Кафедра информатики
Дата:
2019-10Журнал:
Journal of PhysicsКвартиль журнала в Scopus:
Q3Квартиль журнала в Web of Science:
без квартиляБиблиографическое описание:
N, A Timofeev. The problem of the genetic algorithm initial configuration selection [Текст] / A Timofeev N, V Peresunko P, R Nekhonoshin S, V Kukartsev V, V Tynchenko V, S Mikhalev A // Journal of Physics: Conference Series. — 2019.Аннотация:
The genetic algorithm is one of the most well-known and frequently used global
optimization algorithms. The software implementation of the algorithm in many programming
languages and the development of various modifications of the selection parameters only
encourage authors to analyze the GA parameters and search for their optimal values. Many
works are trying to answer the question: what values of input parameters should be used for a
greater likelihood of successfully finding the result. However, they only consider a specific set
of parameters. This article describes the entire set of GA output parameters and draws up a
recommendation for choosing initial values. Favorable sets of parameter values were found.
Based on these sets, you can customize them for specific tasks. This study provides an example
of using these sets to solve the problem of determining the parameters of a welded beam.
Results were obtained corresponding to the best values of similar studies. It is important to
note that in solving this problem, an initial set of parameters was already formulated, which
facilitated the search for a global minimum.