OPTIMIZATION APPROACHES AND APPLICATION OF MATHEMATICAL MODEL OF THE TRAVELING SALESMAN PROBLEM IN TOURISM COMPANIES
Main Article Content
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.
Downloads
Article Details
Section
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are disseminated under the terms of the Creative Commons Attribution License 4.0 (CC-BY), which licenses unrestricted use, distribution, and reproduction in any medium, provided that the original work is appropriately cited. The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.
How to Cite
References
1.Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications.
2.Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (2006). The Traveling Salesman Problem: A Computational Study. Princeton University Press.
3.Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley.
4.Gutin, G., & Punnen, A. P. (2002). The Traveling Salesman Problem and Its Variations. Springer.
5.Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications. Springer.