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:

enter image description here

the node coordinates are:

0 0 4 0 4 2 2.6 3 10 3 4 4 4 6 0 6 

here optimal tour:

enter image description here

now suppose don't need visit node 5. if "close up" original tour, resulting tour has cost of 21.94:

enter image description here

but optimal tour has cost of 21.44:

enter image description here

(if want remove 5 cities instead of 1, put 5 cities close way on right.)


Comments

Popular posts from this blog

php - How to add and update images or image url in Volusion using Volusion API -

javascript - jQuery UI Splitter/Resizable for unlimited amount of columns -

javascript - IE9 error '$'is not defined -