MATLAB Answers

0

Shortest path that passes through certain nodes

Asked by Thanh Tran on 15 Nov 2015
Latest activity Edited by Walter Roberson
on 16 Aug 2016
I have 13 points on a map, the distance from the original point to every other points, and the distance between all points are known. I need to find the shortest path that passes through all 13 points and returning to the original point. Please help! Thank you.

  1 Comment

Does the path only need to pass through all 13 points, or does it need to pass through each of the points exactly once ?
If it needs to pass through each point exactly once and return to the original, then this is known as a Hamiltonian Path, rather than as The Traveling Salesman Problem.

Sign in to comment.

1 Answer

Answer by David Young
on 15 Nov 2015
 Accepted Answer

If you search online for "travelling salesman problem matlab" you will find discussion and code that will help with this problem.