MATLAB Answers

0

Shortest path that passes through certain nodes

Thanh Tran さんによって質問されました 2015 年 11 月 15 日
最新アクティビティ Walter Roberson
さんによって 編集されました 2016 年 8 月 16 日
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
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.

サインイン to comment.

タグ

1 件の回答

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.

  2 件のコメント

Thanh Tran 2015 年 11 月 16 日
Thank you!!!

サインイン to comment.



Translated by