The issue of Kommivoyajer (Travel sales I am the problem — TSP) is one of the issues expansions for eigenvalues of classic discrete optimization, if the minimum distance to all the cities with the cost or one-time visit, return to the starting point requires. The tsp's mathematical formulalashuvi in this article, the main methods or specific (bruteforce, dynamic programming, tarmoqlash-limiting) and approximate (genetic algorithm, near methods) approaches will be covered. Also, the practical issue is to be applied and the complexity is analyzed.TSP his full kombinatorika features and high-level complexity is popular. Kommivoyajer expansions for the eigenvalues of discrete optimization problems is one of the classic issues, if the minimum distance to all the cities with the cost or one-time visit, return to the starting point requires. The tsp's mathematical formulalashuvi in this article, the main methods or specific (bruteforce, dynamic programming, tarmoqlash-limiting) and approximate (genetic algorithm, near methods) approaches will be covered. Also, the complexity of the issue is to be practical and applied analysis this problem is np-complete problem, that is, find its exact solution, it becomes very complicated as the number of issues have increased. The computer algorithm is developed to find the solution through the different, in particular, network search algorithm of genetic algorithm and simulation annealing methods been.Kommivoyajyor the issue of in practice in many areas, for example, logistics, transportation, robotics, and is used in the management of different resources. It also used as a means to increase productivity, optimize and theoretical issues is very important.

travel I am your sales problem (TSP), optimization, combinatorics, NP-completed problem, shortest path algorithms, logistics, transportation, robotics, resource management, simulated annealing, genetic algorithms, network security, algorithms, please find solution.

Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial optimization: Algorithms and complexity. Publication Is Not The Dove.

Applegate, D., Bixby, R., Chvátal, V., & Cookie, W. (2006). Travel I Am Your Sales Problem: A Computational Study. Princeton University Press.

Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The problem I am your sales travel: a guide tour of combinatorial optimization. Wiley.

From Guti, G., & Punnen, A. P. (2002). I am the travel of your sales problem and its Variations. Spring.

Reinelt, G. (1994). I am your sales travel: Computational solutions for TSP Applications. Spring.