The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and . It is focused on optimization. In this context, "better solution" often means "a solution that is cheaper, shorter, or faster". TSP is a mathematical problem. It is most easily expressed as a graph describing the locations of a set of nodes.