Shortest path that passes through certain nodes

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.

[Walter Roberson]

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.

Answer 1

[David Young]

If you search online for "travelling salesman problem matlab" you will find discussion and code that will help with this problem.

[Thanh Tran]

Thank you!!!

[Gustavo Ulloa]

use this function!!! https://www.mathworks.com/matlabcentral/fileexchange/51610-hamiltonian-graph--source--destination-