Shortest path that passes through certain nodes

6 views (last 30 days)
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
Walter Roberson
Walter Roberson on 16 Nov 2015
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.

Accepted Answer

David Young
David Young on 15 Nov 2015
If you search online for "travelling salesman problem matlab" you will find discussion and code that will help with this problem.

More Answers (0)


Find more on Graph and Network Algorithms in Help Center and File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by