Journey computation with re-planning based on events in a transportation network

Patent metadata

Field	Value
Publication number	US-9304006-B2
Application number	US-201213600903-A
Country	US
Kind code	B2
Filing date	Aug 31, 2012
Priority date	Aug 31, 2012
Publication date	Apr 5, 2016
Grant date	Apr 5, 2016

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.

First claim

What is claimed is:

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 network, wherein an occurrence of the potential event results in an ability to improve upon the optimized journey plan;
monitoring the transportation network for the potential event, wherein said monitoring occurs during an execution of the optimized journey plan; and
based on detecting an execution of the potential event, calculating an improved journey plan 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, wherein the improved journey plan is an improvement on the optimized 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 , further comprising: based on a determination that the improved journey plan is better than the optimized journey plan, transmitting the improved journey plan to a user.

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

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

7. The method of claim 5 , wherein the preferred optimization method comprises a shortest route.

8. The method of claim 5 , wherein the preferred optimization method comprises a least expensive route.

9. 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 network, wherein an occurrence of the potential event results in an ability to improve upon the optimized journey plan;
monitoring the transportation network for the potential event, wherein said monitoring occurs during an execution of the optimized journey plan; and
based on detecting an execution of the potential event, calculating an improved journey plan, 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, wherein the improved journey plan is an improvement on the optimized journey plan.

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

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

12. The computer system of claim 9 , 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.

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

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

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

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

17. A computer program product for journey planning, the computer program product comprising:
a non-transitory 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 network, wherein an occurrence of the potential event results in an ability to improve upon the optimized journey plan;
monitoring the transportation network for the potential event, wherein said monitoring occurs during an execution of the optimized journey plan; and
based on detecting an execution of the potential event, calculating an improved journey plan, 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, wherein the improved journey plan is an improvement on the optimized journey plan.

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

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

20. The computer program product of claim 17 , further comprising: based on a determination that the improved journey plan is better than the optimized journey plan, transmitting the improved journey plan to a user.

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

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

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

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

Assignees

• Berlingerio Michele
• Botea Adi I
• Bouillet Eric P
• Calabrese Francesco
• Verscheure Olivier
• IBM

Inventors

• Berlingerio Michele
• Botea Adi I
• Bouillet Eric P
• Calabrese Francesco
• Verscheure Olivier

Classifications

• G01C21/3423 Primary

  Multimodal routing · CPC title

• G01C21/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 title