The Traveling Salesman Problem (TSP)  is an optimization problem in Operations Research and in theoretical Information Technology – a route planning problem, to be more precise. The task here is to find the shortest possible route so that a traveling salesman visits each city on his itinary exactly once and returns to the origin city at the end.