This is actually a very difficult problem, see https://simple.wikipedia.org/wiki/Travelling_salesman_problem

In this case, there is a lot of existing structure which means that, for this set of location, you might get a solution in reasonable time and the remaining difficulty is to find routes between the pairs in in each leg of the journey.

(The standard travelling salesman problem starts with the shortest routes between every pair already being known.)