генетичний алгоритм

The article is devoted to the application of a genetic algorithm for determining the optimal route in a wireless sensor network. The paper presents a classification of data routing strategies based on: the method of determining routes, network structure, network operations, and communication organiser. The genetic algorithm is classified as a multi-path routing strategy, since its use allows obtaining a set of routes.

The article is devoted to the estimation of computational complexity of a genetic algorithm as one of the key tools for solving optimisation problems. The theoretical aspects of computational complexity of algorithms and the interrelation of elements of a genetic algorithm are considered. The main types of computational complexity of algorithms are described: time, simple and asymptotic. Five basic rules for calculating the asymptotic complexity are given.

Наведено метод апроксимації функцій поліномами з дійсними степенями, в якому підбір степеня здійснюється за допомогою генетичного алгоритму.

The method of approximation of functions by polynomials with real powers, which is the power of selection with a genetic algorithm.

The article focuses on the peculiarities of using the genetic algorithm (GA) for solving optimization problems. It provides a classification of optimization problems and offers a detailed description of the structural elements of the GA and their role in solving the traveling salesman problem. To assess the impact of GA parameters on its effectiveness, a study on the influence of population size on the length of the traveling salesman's route is conducted.

 Features of designing a system of automated generation of poetic works, which opens up new opportunities for artistic speech and show business, especially the preparation of poems and songs have been considered. Quite often lyrics without special content become successful due to the lack of complex plots, as well as due to the unobtrusiveness and ease of perception by listeners. Well-known literature sources and available software products that can generate poetic works by combining different methods and algorithms are analyzed.

A method for constructing the empirical models of complex processes has been developed on the basis of genetic algorithms which, compared to the inductive method of self-organization of models, significantly reduces computer time for their implementation. An approach has been used that allows a complex model to be considered as a composition of three components, i.e. a linear trend, an oscillatory component with non-multiple frequencies and a regression equation which simplifies the process of building complex models.

Розроблено генетичний алгоритм та оператор схрещування. Запропоновано застосування генетичних алгоритмів і операторів схрещування для розв’язання складних оптимізаційних задач. Виконані експерименти показують ефективність запропонованого генетичного алгоритму й оператора схрещування.

The problem of optimal processing tasks in the nodes of a distributed information system on the basis of a mathematical model belonging to a class of two-clustering problems, for which an optimization problem with a fractional linear target function is formulated, was investigated.