TRAVEL TIME AND ROUTING

• US 20160202075A1
• Filed: 08/27/2013
• Published: 07/14/2016
• Est. Priority Date: 08/27/2013
• Status: Abandoned Application

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: LIU, Lian, GUPTA, Chetan Kumar, VISWANATHAN, Krishnamurthy
• Application Number:
  US14/913,742
• Publication Number:
  US 20160202075A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/3492 employing speed data or traffic data, e.g. real-time or historical traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/096811 where the route is computed offboard
• CPC Class Codes: G08G 1/096844 where the complete route is dynamically recomputed based on new data
• CPC Class Codes: G08G 1/096888 where input information is obtained using learning systems, e.g. history databases

Abstract

Disclosed herein are a system, non-transitory computer readable medium, and method to handle a routing problem. It is determined whether a fastest route can be resolved using static routing or time dependent routing.

Claims

1. A system comprising:

a storage comprising a machine learning module;

a routing module which upon execution causes at least one processor to

handle a request for a fastest route between a first location and at least one destination location;

obtain a travel time threshold predetermined by the machine learning module;

determine an approximate travel time between the first location and the at least one destination location; and

compare the travel time threshold to the approximate travel time to determine whether the fastest route can be resolved using a static routing approach or a time dependent routing approach.

2. The system of claim 1, wherein the routing module upon execution further causes at least one processor to use the static routing approach if the approximate travel time is less than the travel time threshold.

3. The system of claim 1, wherein the routing module upon execution further causes the at least one processor to use the time dependent routing approach if the approximate travel time is more than or equal to the travel time threshold.

4. The system of claim 1, wherein to calculate the travel time threshold the machine learning module upon execution further instructs at least one processor to solve a plurality of random routing problems within a predetermined geographic radius such that each random routing problem is solved using the static routing approach and the time dependent routing approach.

5. The system of claim 4, wherein to calculate the time threshold the machine learning module upon execution further instructs at least one processor to:

determine an error adjusted static routing time for each random routing problem; and

determine an error adjusted time dependent routing time for each random routing problem.

6. The system of claim 5, wherein to calculate the time threshold the machine learning module upon execution further instructs at least one processor to

determine whether a given error adjusted static routing time is substantially equivalent to a given error adjusted time dependent routing time;

and

set the travel time threshold to be substantially equivalent to the given error adjusted static routing time or the given error adjusted time dependent routing time, if the given error adjusted static routing time is substantially equivalent to the given error adjusted time dependent routing time.

7. A non-transitory computer readable medium having instructions therein which upon execution cause at least one processor to:

handle a request to resolve a routing problem such that a solution thereto comprises a fastest route between a first location and at least one destination;

determine an approximate travel time between the first location and the at least one destination;

resolve the routing problem using static routing if the approximate travel time is less than a predetermined travel time threshold; and

resolve the routing problem using time dependent routing if the approximate travel time is greater than or equal to the predetermined travel time threshold.

8. The non-transitory computer readable medium of claim 7, wherein the instructions therein upon execution further cause at least one processor to calculate the travel time threshold by resolving a plurality of random routing problems within a predetermined geographic radius such that each random routing problem is solved using static routing and time dependent routing.

9. The non-transitory computer readable medium of claim 8, wherein the instructions therein upon execution further cause at least one processor to:

calculate an error adjusted static routing time for each random routing problem; and

calculate an error adjusted time dependent routing time for each random routing problem.

10. The non-transitory computer readable medium of claim 9 wherein the instructions therein upon execution further cause at least one processor to:

determine whether a given error adjusted static routing time is substantially equivalent to a given error adjusted time dependent routing time; and

set the travel time threshold to be substantially equivalent to the given error adjusted static routing time or the given error adjusted time dependent routing time, if the given error adjusted static routing time is substantially equivalent to the given error adjusted time dependent routing time.

11. A method comprising:

reading, using at least one processor, a request to resolve a fastest route between a first location and at least one other location;

determining, using at least one processor, an approximate travel time between the first location and the at least one other location; and

analyzing, using at least one processor, the approximate travel time to determine whether the fastest route can be resolved using static routing or time dependent routing.

12. The method of claim 11, further comprising

resolving, using at least one processor, the fastest route using static routing, if the approximate travel time is less than a predetermined travel time threshold;

and

resolving, using at least one processor, the fastest route using time dependent routing, if the approximate travel time is greater than or equal to the predetermined travel time threshold.

13. The method of claim 12, wherein determining the travel time threshold comprises resolving, using at least one processor, a plurality of random routing problems within a predetermined geographic radius such that each random routing problem is solved using static routing and time dependent routing.

14. The method of claim 13, further comprising

calculating, using at least one processor, an error adjusted static routing time for each random routing problem;

and

calculating, using at least one processor, an error adjusted time dependent routing time for each random routing problem.

15. The method of claim 14, further comprising

determining, using at least one processor, whether a given error adjusted static routing time is substantially equivalent to a given error adjusted time dependent routing time;

and

setting, using at least one processor, the travel time threshold to be substantially equivalent to the given error adjusted static routing time or the given error adjusted time dependent routing time, if the given error adjusted static routing time is substantially equivalent to the given error adjusted time dependent routing time.