Solving TSP Problems with Integer Programming

Abstract

The traveling salesman problem (TSP) is one of the NP-hard problems in combinatorial optimization. This paper focuses on finding the optimal planning path using integer programming and adding time allocation to minimize the cost. The use and accuracy of various algorithms are also compared in solving this problem.