I have a problem about sorting the searching results by some values such as covered distance, time in covered distance and rest distance. I want to explain it with examples in the attachment.
Searcing is always for from point A to point B and distance between them is always 300 km. In the examples, I used 2 and 3 points for bounces. In the real, there are too many points to bounce such as 30-40 points. Every time interval(minute) and long measures(km) between all points are different for each other. I need a mathematical formula to sort them smartly by using covered distance, time in covered distance and rest distance. I think to use it in my graduation project.