OPTIMIZATION APPROACHES AND APPLICATION OF MATHEMATICAL MODEL OF THE TRAVELING SALESMAN PROBLEM IN TOURISM COMPANIES

Abstract

This article analyzes the Travelling Salesman Problem (TSP) and its optimization approaches, which play a significant role in the efficient operation of tourism companies. In particular, factors such as planning travel routes, reducing transportation costs, and saving time increase the relevance of this problem.The paper presents the classical formulation of the TSP and examines its mathematical model and combinatorial optimization methods. In particular, approaches such as dynamic programming, genetic algorithms, and approximation algorithms are analyzed, with a focus on their applicability to the activities of tourism companies, supported by practical examples.In addition, the article provides the results of a software simulation based on real-world data from a tourism company and demonstrates the effectiveness of modern algorithms in determining optimal routes.The results of the study can be beneficial in increasing competitiveness in the tourism sector, improving logistics systems, and enhancing the quality of service delivery.