Shortest path that passes through certain nodes

8 vues (au cours des 30 derniers jours)
Thanh Tran
Thanh Tran le 15 Nov 2015
Modifié(e) : Walter Roberson le 16 Août 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 commentaire
Walter Roberson
Walter Roberson le 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.

Connectez-vous pour commenter.

Réponse acceptée

David Young
David Young le 15 Nov 2015
If you search online for "travelling salesman problem matlab" you will find discussion and code that will help with this problem.
  2 commentaires
Thanh Tran
Thanh Tran le 16 Nov 2015
Thank you!!!

Connectez-vous pour commenter.

Plus de réponses (0)

Community Treasure Hunt

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

Start Hunting!

Translated by