Kutelmakh R. Mathematical methods and software for solving large scale traveling salesman problem

The thesis deals with large-scale traveling salesman problem, which has wide applications in transportation systems, computer-aided design, testing and manufacturing of integrated circuits, printed circuit board manufacturing and other industries. Improved existing and developed new decomposition methods, in which the problem is solved by several steps: partitioning of the input set of points into smaller subsets with limited dimensions (500-2000 points), with possibility to obtain high-quality partial solutions with the small time cost; concatenation of partial solutions into in the initial solution, and it's optimization by developed methods.