DETERMINING AN OPTIMAL VEHICULAR TRANSPORTATION ROUTE

• US 20140278085A1
• Filed: 03/15/2013
• Published: 09/18/2014
• Est. Priority Date: 03/15/2013
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Zuo, Ying
• Application Number:
  US13/840,556
• Publication Number:
  US 20140278085A1
• Time in Patent Office: Days
• US Class Current: 701/527
• CPC Class Codes: G01C 21/3476 using point of interest [POI] information, e.g. a route passing visible POIs
• 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

Abstract

Embodiments of the present invention disclose a method, computer program product, and system for determining an optimal vehicular transportation route using location based services. A computing device receives a point of origin and destination. The computing device determines a plurality of vehicular transportation routes between the starting point and destination. The computing device also determines an optimal vehicular transportation route included in the plurality of vehicular transportation routes by comparing two vehicular transportation routes included in the plurality of transportation routes that each have a proprietary point of interest within a predetermined distance. Each vehicular transportation route includes the respective proprietary point of interest. Further, each proprietary point of interest is associated with the computing device.

Claims

1. A method for determining an optimal vehicular transportation route, the method comprising:

receiving, by a computing device, a point of origin and destination;

determining a plurality of vehicular transportation routes between the point of origin and destination;

determining an optimal vehicular transportation route included in the plurality of vehicular transportation routes by comparing two vehicular transportation routes included in the plurality of transportation routes that each have a proprietary point of interest within a predetermined distance;

wherein each vehicular transportation route includes a respective proprietary point of interest; and

wherein each proprietary point of interest is associated with the computing device.

2. The method of claim 1, wherein the optimal vehicular transportation route is determined using one of the following:

a fastest path algorithm;

a shortest path algorithm;

a simplest path algorithm;

a most scenic path algorithm; and

a safest path algorithm.

3. The method of claim 1, wherein the two vehicular transportation routes are summarized by time units.

4. The method of claim 1, wherein the two vehicular transportation routes are summarized by distance.

5. The method of claim 1, wherein the determining an optimal vehicular transportation route includes utilizing real-time and/or historic vehicular traffic information associated with the point of origin and/or destination.

6. The method of claim 1, wherein the determining an optimal vehicular transportation route includes utilizing crime information associated with the point of origin and/or destination.

7. A computer program product for determining an optimal vehicular transportation route, the computer program product comprising:

one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising;

program instructions to receive a point of origin and destination;

program instructions to determine a plurality of vehicular transportation routes between the point of origin and destination; and

program instructions to determine an optimal vehicular transportation route included in the plurality of vehicular transportation routes by comparing two vehicular transportation routes included in the plurality of transportation routes that each have a proprietary point of interest within a predetermined distance, wherein each vehicular transportation route includes a respective proprietary point of interest, and wherein each proprietary point of interest is associated with a computing device configured to execute the computer program product.

8. The computer program product of claim 7, wherein the optimal vehicular transportation route is determined using one of the following:

a fastest path algorithm;

a shortest path algorithm;

a simplest path algorithm;

a most scenic path algorithm; and

a safest path algorithm.

9. The computer program product of claim 7, wherein the two vehicular transportation routes are summarized by time units.

10. The computer program product of claim 7, wherein the two vehicular transportation routes are summarized by distance.

11. The computer program product of claim 7, wherein the determining an optimal vehicular transportation route includes utilizing real-time and/or historic vehicular traffic information associated with the point of origin and/or destination.

12. The computer program product of claim 7, wherein the determining an optimal vehicular transportation route includes utilizing crime information associated with the starting point and/or destination.

13. A computer system for determining an optimal vehicular transportation route, the computer system comprising:

one or more computer processors;

one or more computer-readable storage media; and

program instructions stored on the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising;

program instructions to receive a point of origin and destination;

program instructions to determine a plurality of vehicular transportation routes between the point of origin and destination; and

program instructions to determine an optimal vehicular transportation route included in the plurality of vehicular transportation routes by comparing two vehicular transportation routes included in the plurality of transportation routes that each have a proprietary point of interest within a predetermined distance, wherein each vehicular transportation route includes a respective proprietary point of interest, and wherein each proprietary point of interest is associated with the at least one of the one or more processors.

14. The computer system of claim 13, wherein the optimal vehicular transportation route is determined using one of the following:

a fastest path algorithm;

a shortest path algorithm;

a simplest path algorithm;

a most scenic path algorithm; and

a safest path algorithm.

15. The computer system of claim 13, wherein the two vehicular transportation routes are summarized by time units.

16. The computer system of claim 13, wherein the two vehicular transportation routes are summarized by distance.

17. The computer system of claim 13, wherein the determining an optimal vehicular transportation route includes utilizing real-time and/or historic vehicular traffic information associated with the point of origin and/or destination.

18. The computer system of claim 13, wherein the determining an optimal vehicular transportation route includes utilizing crime information associated with the point of origin and/or destination.