It's about finding the shortest route to visit all the systems.

That's something completely different to 'I am not allowed to visit a system twice'.

Sure one could simply jump from system 1 to system 2 to system three. But in this case the systems closest to each other are not the systems next in ascending order and therefore this would take much more time than needed.

And this problem gets worse the more points there are.

I bookmarked 119 systems, that would be more than 2,34*10^194 possible routes.

Additionally the exact coordinates of the systems are only known after you visit them (they get written in your log file), so there is literally no way to find the optimal solution.

Furthermore, humans solving two dimensional TSPs have an error margin of 0-1% at ten points, 1-4% at 20 points and 2-5% at 50 points.

Solving three dimensional TSPs are worse, see

www.researchgate.net/publication/48202356_2D_and_3D_Traveling_Salesman_Problem for more info.

I hate the TSP because I'm wasting time on non optimal routes.