System and method for efficient travel time and route computation
First Claim
1. A computer-implemented system configured to compute an optimized routing sequence for a set of task sites, the system comprising:
- digital data storage; and
at least one processor coupled to the digital data storage configured to execute instructions to;
for each task site of the set of task sites;
search for previously cached travel times between a starting location and the task site, wherein the previously cached travel times were previously obtained from a request, sent via network communications using an application programming interface, to a third party service to calculate a travel time between the starting location and the task site; and
transform the previously cached travel times to a route output by;
calculating a regional average speed based on the previously cached travel times and corresponding travel distances;
testing multiple possible routes from the starting location and proceeding in series to the set of tasks using straight line distances and the regional average speed to obtain distances and travel times for every segment of the multiple possible routes without sending, via network communications using the application programming interface, a second request for using the third party service; and
identifying the route output as a shortest route of one of the multiple possible routes satisfying predetermined conditions for the set of task sites; and
output the route output.
1 Assignment
0 Petitions
Accused Products
Abstract
A system and method efficiently computes travel times between an origin and destination, minimizing expensive calls to a third party service by first geographically expanding both origin and destination and then searching a cache of previously computed or obtained travel times for any route satisfying the expanded origin and destination. A further embodiment concerns a system and method to prepare an optimized routing sequence to travel to a set of geographical task sites, in satisfaction of applicable conditions for one or more of the task sites. Advantageously, optimized routing may employ the disclosed method of computing travel times between origin and destination.
21 Citations
17 Claims
-
1. A computer-implemented system configured to compute an optimized routing sequence for a set of task sites, the system comprising:
-
digital data storage; and at least one processor coupled to the digital data storage configured to execute instructions to; for each task site of the set of task sites; search for previously cached travel times between a starting location and the task site, wherein the previously cached travel times were previously obtained from a request, sent via network communications using an application programming interface, to a third party service to calculate a travel time between the starting location and the task site; and transform the previously cached travel times to a route output by; calculating a regional average speed based on the previously cached travel times and corresponding travel distances; testing multiple possible routes from the starting location and proceeding in series to the set of tasks using straight line distances and the regional average speed to obtain distances and travel times for every segment of the multiple possible routes without sending, via network communications using the application programming interface, a second request for using the third party service; and identifying the route output as a shortest route of one of the multiple possible routes satisfying predetermined conditions for the set of task sites; and output the route output. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method to compute an optimized routing sequence for a set of task sites, the method comprising:
-
for each task site of a set of task sites; searching for previously cached travel times between the starting location and the task site, wherein the previously cached travel times were previously obtained from a request, sent via network communications using an application programming interface, to a third party service to calculate a travel time between the starting location and the task site; and transforming the previously cached travel times to a route output, wherein transforming the previously cached travel times to the route output comprises; calculating a regional average speed based on the previously cached travel times and corresponding travel distances; and testing multiple possible routes from the starting location and proceeding in series to the set of tasks using straight line distances and the regional average speed to obtain distances and travel times for every segment of the multiple possible routes without sending, via network communications using the application programming interface, a second request for using the third party service; and identifying the route output as a shortest route of one of the multiple possible routes satisfying predetermined conditions for the set of task sites; and outputting the route output. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer-implemented system, comprising:
-
digital data storage; and at least one processor coupled to the digital data storage configured to execute instructions for; searching the digital data storage for previously cached travel times between a starting location and each task site of a set of task sites; and transforming the previously cached travel times to a route output by; calculating a regional average speed based on the previously cached travel times and corresponding travel distances; testing multiple possible routes from the starting location and proceeding in series to the set of task sites using straight line distances and the regional average speed to obtain distances and travel times for every segment of the multiple possible routes without sending, via network communications using an application programming interface, a request for using the third party service; and identifying the route output as a shortest route of the multiple possible routes satisfying predetermined conditions for the set of task sites; and outputting the route output.
-
Specification