Using travelling salesman principle to evaluate the minimum total cost of the Iraqi cities

Abstract EN

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem.

The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.

In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities.

So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT).

For the BABT, more than one lower and upper bounds are be derived to gain the best one.

The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25.

These results proof the efficiency of BABT compared with some good heuristic methods.

We are suggesting some additional techniques to improve the computation time of BABT for n ≤ 80.