Aspects of the Study of Genetic Algorithms and Mechanisms for their Optimization for the Travelling Salesman Problem

Nataliya Boyko, Andriy Pytel
2021 International Scientific Journal of Computing  
Lately, artificial intelligence has become increasingly popular. Still, at the same time, a stereotype has been formed that AI is based solely on neural networks, even though a neural network is only one of the numerous directions of artificial intelligence. This paper aims to bring attention to other directions of AI, such as genetic algorithms. In this paper, we study the process of solving the travelling salesman problem (TSP) via genetic algorithms (GA) and consider the issues of this
more » ... . The genetic algorithm is a method for solving both constrained and unconstrained optimization problems that are based on natural selection, the process that drives biological evolution. One of the common problems in programming is the travelling salesman problem. Many methods can be used to solve it, but we are going consider genetic algorithms. This study aims at developing the most efficient application of genetic algorithms in the travelling salesman problem.
doi:10.47839/ijc.20.4.2442 fatcat:6gljt4wx2vbsvnek474jzvgqqi