I try this solution:

I have n waypoints, for example: A, B,C,D,E

A is START

1) I search all distances from A to other (only geodetic distance, not road)
2) find the waypoint with major distance. (and for example I find C)

3) I create new waypoints "Z" near C a little far away from A (I create a Line passing in A and C and create waypoints along this line near C but in direction inverse from A).

4) I optimize waypoints , delete Z and take KM of trip

5) I Create new waypoints "Z2" on A
6) I optimize waypoints, delete Z2 and take KM of trip

7) I choose minor km from 2 trips

Anyone have some ideas about?