Jump to content

How can we check a solution to the Traveling Salesman Problem


TakenItSeriously

Recommended Posts

Assume that you have discovered a method that can determine a very efficient route for any given set of cities every time, but your not sure if its the most efficient route.

How can we know if the resulting route is the most efficient? i.e. how can we test the method we have discovered to be the solution without actually solving all permutations for every problem?

Is their some formula that produces the minimum distance without giving the route?

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.