Department of Computer Science and Information Technology, College of Computer Science & Information Technology, Firat University, turkey

This paper provides uses a new Ant Colony based algorithms called U-Turning Ant colony optimization (U-TACO) for solving one of NP-Hard problems which is widely used in computer science field called Traveling Salesman Problem (TSP). U-Turning Ant colony Optimization based on making partial tour as an initial state for the basic Ant Colony algorithm. This paper provides tables and charts for the results obtained by U-Turning Ant colony Optimization for various TSP problems from the TSPLIB95.