JOURNEY COMPUTATION WITH RE-PLANNING BASED ON EVENTS IN A TRANSPORTATION NETWORK

• US 20140067266A1
• Filed: 08/31/2012
• Published: 03/06/2014
• Est. Priority Date: 08/31/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Berlingerio, Michele, Botea, Adi I., Bouillet, Eric P., Calabrese, Francesco, Verscheure, Olivier
• Granted Patent: US 9,304,006 B2
• Time in Patent Office: Days
• US Class Current: 701/533
• CPC Class Codes: G01C 21/3415 Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
• CPC Class Codes: G01C 21/3423 Multimodal routing, i.e. combining two or more modes of transportation, where the modes can be any of, e.g. driving, walking, cycling, public transport

Abstract

Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.

Claims

1. A method for journey planning, the method comprising:

receiving a journey planning request, the request comprising an origin and a destination in a transportation network;

calculating, by a processor, an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network;

identifying a potential event in the transportation;

monitoring the transportation network for the potential event; and

based on detecting an execution of the potential event, calculating an improved journey plan.

2. The method of claim 1, wherein the transportation network is a multi-modal transportation network.

3. The method of claim 1, wherein the potential event is a change in an expected execution of the optimized journey plan.

4. The method of claim 1, wherein the potential event is a change in a schedule of one or more elements of the transportation network that are not included in the optimized journey plan.

5. The method of claim 1, further comprising:

based on a determination that the improved journey plan is better that the optimized journey plan, transmitting the improved journey plan to a user.

6. The method of claim 1, wherein the journey planning request further comprises a preferred optimization method.

7. The method of claim 6, wherein the preferred optimization method comprises a fastest route.

8. The method of claim 6, wherein the preferred optimization method comprises a shortest route.

9. The method of claim 6, wherein the preferred optimization method comprises a least expensive route.

10. A computer system for journey planning, the computer system comprising:

a journey planning server having a processor, the processor configured to perform a method comprising;

receiving a journey planning request, the request comprising an origin and a destination in a transportation network;

calculating, by a processor, an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network;

identifying a potential event in the transportation;

monitoring the transportation network for the potential event; and

based on detecting an execution of the potential event, calculating an improved journey plan.

11. The computer system of claim 10, wherein the transportation network is a multi-modal transportation network.

12. The computer system of claim 10, wherein the potential event is a change in an expected execution of the optimized journey plan.

13. The computer system of claim 10, wherein the potential event is a change in a schedule of one or more elements of the transportation network that are not included in the optimized journey plan.

14. The computer system of claim 10, further comprising:

based on a determination that the improved journey plan is better that the optimized journey plan, transmitting the improved journey plan to a user.

15. The computer system of claim 10, wherein the journey planning request further comprises a preferred optimization method.

16. The computer system of claim 15, wherein the preferred optimization method comprises a fastest route.

17. The computer system of claim 15, wherein the preferred optimization method comprises a shortest route.

18. The computer system of claim 15, wherein the preferred optimization method comprises a least expensive route.

19. A computer program product for journey planning, the computer program product comprising:

a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising;

computer readable program code configured for;

receiving a journey planning request, the request comprising an origin and a destination in a transportation network;

calculating, by a processor, an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network;

identifying a potential event in the transportation;

monitoring the transportation network for the potential event; and

based on detecting an execution of the potential event, calculating an improved journey plan.

20. The computer program product of claim 19, wherein the transportation network is a multi-modal transportation network.

21. The computer program product of claim 19, wherein the potential event is a change in an expected execution of the optimized journey plan.

22. The computer program product of claim 19, wherein the potential event is a change in a schedule of one or more elements of the transportation network that are not included in the optimized journey plan.

23. The computer program product of claim 19, further comprising:

based on a determination that the improved journey plan is better that the optimized journey plan, transmitting the improved journey plan to a user.

24. The computer program product of claim 19, wherein the journey planning request further comprises a preferred optimization method.

25. The computer program product of claim 24, wherein the preferred optimization method comprises a fastest route.

26. The computer program product of claim 24, wherein the preferred optimization method comprises a shortest route.

27. The computer program product of claim 24, wherein the preferred optimization method comprises a least expensive route.