Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application

In this research we find an optimal solutions for traveling salesman problem (TSP) using Branch and Bound method as well as we use an intelligence techniques represented by ant colony optimization (ACO) and applied them on the DNA chain data, where the technique method give an optimal solution with high efficiency.