Borrar filtros
Borrar filtros

Shortest path that passes through certain nodes

3 visualizaciones (últimos 30 días)
Thanh Tran
Thanh Tran el 15 de Nov. de 2015
Editada: Walter Roberson el 16 de Ag. de 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 comentario
Walter Roberson
Walter Roberson el 16 de Nov. de 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.

Iniciar sesión para comentar.

Respuesta aceptada

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

Más respuestas (0)


Community Treasure Hunt

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

Start Hunting!

Translated by