Solving TSP Problems with Integer Programming

Document Type

Conference Proceeding

Publication Date

1-1-2022

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.

Publication Title

Journal of Physics: Conference Series

DOI

10.1088/1742-6596/2381/1/012045

This document is currently not available here.

Share

COinS