Shortest path that passes through certain nodes
3 次查看(过去 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
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
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!