An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality
2015 ◽
Vol 6
(1)
◽
pp. 35-46
◽
Keyword(s):
Traveling salesman problem (TSP) is a classic combinatorial optimization problem. The time complexity of the exact algorithms is generally an exponential function of the scale of TSP. This work gives an approximate algorithm with a four-vertex-three-line inequality for the triangle TSP. The time complexity is O(n2) and it can generate an approximation less than 2 times of the optimal solution. The paper designs a simple algorithm with the inequality. The algorithm is compared with the double-nearest neighbor algorithm. The experimental results illustrate the algorithm find the better approximations than the double-nearest neighbor algorithm for most TSP instances.
2021 ◽
Vol 17
(4)
◽
pp. 1-20
2015 ◽
Vol 2015
◽
pp. 1-6
◽
2014 ◽
Vol 886
◽
pp. 593-597
◽
2019 ◽
Vol 10
(2)
◽
pp. 55-92
◽
2013 ◽
Vol 373-375
◽
pp. 1089-1092