shortest path travelling from start point with any end point

[handasa]

Greetings Everyone

given a list of points and start point any idea how to find the shortest  path -or at least the shortest path in trial time-  to travel from the start point and visit all other points in the list no matter where the end point is.

Edited November 24, 2019 by handasa

[marko_ribar]

You just forgot to say that you have point list with 100000000000000000000000000 points... 

BTW. TSP is not solvable problem...

Edited November 24, 2019 by marko_ribar

[handasa]

4 minutes ago, marko_ribar said:

You just forgot to say that you have point list with 100000000000000000000000000 points... 

BTW. TSP is not solvable problem...

the solution need not to be the shortest path.i need a "good" solution without intersections.
lets say i a given trial and error period

[marko_ribar]

If you increment Z coordinate of each next point connection, there will be no chance that path will self intersect...

[BIGAL]

garmin make cool GPS units that do routing, now how can I load the 1000000000000000 points into it. 

 

Shortest path (command "line" pt1 pt2 "") 

 

Do some googling there are solutions out there.