Comparison between branch and cutting algorithm and ant colony algorithm in order to contribute solving the problem of postman Traveling Salesman Problem

In this research we are studying the possibility of contributing in solving the problem of the Traveling Salesman Problem, which is a problem of the type NP-hard . And there is still no algorithm provides us with the Optimal solution to this problem . All the algorithms used to give solutions which are close to the optimal one .