traveling salesman - Does the optimum solution of a TSP remain the optimum even after skipping a few cities? -
let's know global optimum solution 100-city standard travelling salesman problem. now, lets salesman wants skip on 5 of cities. tsp have re-solved? sequence of cities obtained deleting cities previous optimum solution global optimum new 95-city tsp?
updated: replaced counterexample euclidean instance.
great question.
no, if remove cities, original sequence of cities not remain optimal. here counterexample:
the node coordinates are:
0 0 4 0 4 2 2.6 3 10 3 4 4 4 6 0 6
here optimal tour:
now suppose don't need visit node 5. if "close up" original tour, resulting tour has cost of 21.94:
but optimal tour has cost of 21.44:
(if want remove 5 cities instead of 1, put 5 cities close way on right.)
Comments
Post a Comment