Investigating the Efficiency of Tournament Selection Operator in Genetic Algorithm for Solving TSP

This paper is dedicated to the selection of a type of tournament selection operator in the genetic algorithm for solving the traveling salesman problem. An analysis of the characteristics of tournament selection operators that are crucial for ensuring diversity and selecting the best solutions to create a new generation has been carried out. To conduct the efficiency study of applying the k-Tournament Selection operator with k=2 and k=3, a file named u28.tsp with data for 28 cities in Ukraine has been created. The obtained results demonstrate the effectiveness of using the k-Tournament Selection operator with k=3 to obtain the shortest length route for the traveling salesman. Thus, this paper underscores the importance of choosing the tournament selection operator in the genetic algorithm to achieve optimal results.