You mean the Travelling salesman problem.
There are some articles in the web for (spatia)l solutions of this problem.
As a first step you could calculate all possible ways ("brute Force") and find the shortest one.
But this method is only for small numbers of points.

i have displayed all the six points in sql developer-georatper, manually measured and checked
the shortest distance (263.7) is correct, but the route should include these following points. (start point, intermediate point 1, intermediate point 2 and end point)
you mentioned route includes (1111) ??

can you please confirm whether brute force logic has considered all four intermediate points in addition to start point and end point ?
can i use the same logic by increasing number of intermediate points ?

can you please confirm whether brute force logic has considered all four intermediate points in addition to start point and end point ?

In the first query it is allowed to use a intermediate point more than once. So the solution "goes" from the start point to point 1, from there again to point 1 (stays there), this three times and finaly to the end point. So the solution is "strange" but correct. In the new query I don't use the same point twice.

can i use the same logic by increasing number of intermediate points ?

You can extend the number of FOR LOOP according to the number of intermediare points until the time for calculating the solution becomes to high or ORACLE "gives up". This is the main problem with brute force search.
But now, as you have an example just try it!