Shortest path that passes through certain nodes

조회 수: 5(최근 30일)
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
Walter Roberson
Walter Roberson 2015년 11월 16일
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.

댓글을 달려면 로그인하십시오.

채택된 답변

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

추가 답변(0개)


Community Treasure Hunt

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

Start Hunting!

Translated by