Approximate Algorithms Design for Solving NP-Complete Problems

The object of the research is the modern methods for solving Traveling Salesman Problem, which is belong to NP-complete class of problems. The aim of the work is to study the actual methods of constructing algorithms for solving the traveling salesman problem. The relevance of this study can not be depreciate, particulary, in modern time, it is extremely urgent to find a solution for the problems of finding optimal logistics routes. The analysis of the most modern methods of solving this problem was studied during the work, classification and overview were made. In the course of the research, an algorithm was compiled and represent a modification built on the basis of existing methods for the traveling salesman problem. As a result, the prepared modification of the algorithm showed satisfactory results for problems in contrast to the result obtained using one of the methods originally considered. However it is necessarily to continue searching for further, more successful modifications.