U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem
Keyword(s):
This paper provides a new Ant based algorithms called U-Turning Ant colony optimization (U-TACO) for solving a well-known NP-Hard problem, which is widely used in computer science field called Traveling Salesman Problem (TSP). Generally U-Turning Ant colony Optimization Algorithm makes a partial tour as an initial state for the basic conventional 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.
2019 ◽
Vol 8
(2)
◽
pp. 32
◽
2020 ◽
Vol 1
(36)
◽
pp. 105-108
2019 ◽
Vol 42
(3)
◽
pp. 1-7
2015 ◽
Vol 7
(1)
◽
pp. 1329-1334
2018 ◽
Vol 6
(3)
◽
pp. 368-386
◽
2013 ◽
Vol 5
(10)
◽
pp. 637-644
2011 ◽
pp. 404-409
◽