Ann: Response to ASX Query, page-155

This routing problem is known as the "travelling salesman problem"[1]. There is currently no perfect solutions to this problem (it is NP-hard), but there are some well know heuristics that are within 2% of the optimal and if the number of points to be visited are smallish (under 100) then you can just brute force the optimal solution. This is what I suspect GSW had done - nothing new or novel.

The really hard part is being able to change the route dynamically based on traffic congestion. To do this you need a very large number of drivers on the road using your application (a minimum of 1 in 100 of all drivers on the road) to provide to be able to update the congestion data in real time. GSW does not have this feature, but some of the driving apps like Waze do. It is possible they are tapping into the Waze data stream, but it doesn't look like it.

1. https://en.wikipedia.org/wiki/Travelling_salesman_problem