Systems and methods for generating transit trips
First Claim
Patent Images
1. A computer-implemented method for public transportation journey planning, the method comprising:
- receiving, by one or more computing devices, transit graph data describing a plurality of nodes, each node corresponding to the arrival or departure of a vehicle at a station;
performing, by the one or more computing devices, a first search of the transit graph data to determine a first journey schedule for a route between a source station and a destination station, the first journey schedule comprising a first departure time from the source station, a first arrival time at the destination station, and one or more first intermediate departure times from one or more intermediate stations;
performing, by the one or more computing devices, a second search of the transit graph data to determine a second journey schedule for the route, the second journey schedule comprising the first arrival time at the destination station, a second departure time from the source station, and one or more second intermediate departure times from the one or more intermediate stations, wherein the second departure time and the one or more second intermediate departure times are latest times available to achieve the first arrival time at the destination station;
performing, by the one or more computing devices, a third search of the transit graph data to determine a third journey schedule for the route, the third journey schedule comprising the second departure time from the source station, the first arrival time at the destination station, and one or more third intermediate departure times from the one or more intermediate stations, wherein the one or more third intermediate departure times are earliest times available to maintain the second departure time from the source station and the first arrival time at the destination station; and
presenting to a user, by the one or more computing devices, one or more of the first departure time, the first arrival time, the one or more first intermediate departure times, the second departure time, the one or more second intermediate departure times, or the one or more third intermediate departure times.
2 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods for generating transit trips between an origin and a destination are provided. Searches can be undertaken to identify optimal departure times from a source station and/or one or more intermediate stations while maintaining a lowest cost arrival time at a destination station. In this manner, public transportation journey schedules for routes can be determined and recommendations can be provided even if different journey schedules show identical costs.
28 Citations
16 Claims
-
1. A computer-implemented method for public transportation journey planning, the method comprising:
-
receiving, by one or more computing devices, transit graph data describing a plurality of nodes, each node corresponding to the arrival or departure of a vehicle at a station; performing, by the one or more computing devices, a first search of the transit graph data to determine a first journey schedule for a route between a source station and a destination station, the first journey schedule comprising a first departure time from the source station, a first arrival time at the destination station, and one or more first intermediate departure times from one or more intermediate stations; performing, by the one or more computing devices, a second search of the transit graph data to determine a second journey schedule for the route, the second journey schedule comprising the first arrival time at the destination station, a second departure time from the source station, and one or more second intermediate departure times from the one or more intermediate stations, wherein the second departure time and the one or more second intermediate departure times are latest times available to achieve the first arrival time at the destination station; performing, by the one or more computing devices, a third search of the transit graph data to determine a third journey schedule for the route, the third journey schedule comprising the second departure time from the source station, the first arrival time at the destination station, and one or more third intermediate departure times from the one or more intermediate stations, wherein the one or more third intermediate departure times are earliest times available to maintain the second departure time from the source station and the first arrival time at the destination station; and presenting to a user, by the one or more computing devices, one or more of the first departure time, the first arrival time, the one or more first intermediate departure times, the second departure time, the one or more second intermediate departure times, or the one or more third intermediate departure times. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computing system for public transportation journey planning comprising:
-
a memory configured to store transit graph data describing a plurality of nodes, each node corresponding to the arrival or departure of a vehicle at a station; a processor configured to determine a first journey schedule from the transit graph data for a route between a source station and a destination station, the first journey schedule comprising a first departure time from the source station, a first arrival time at the destination station, and one or more first intermediate departure times from one or more intermediate stations; the processor configured to determine a second journey schedule from the transit graph data for the route, the second journey schedule comprising the first arrival time at the destination station, a second departure time from the source station, and one or more second intermediate departure times from the one or more intermediate stations, wherein the second departure time and the one or more second intermediate departure times are latest times available to achieve the first arrival time at the destination station; the processor configured to determine a third journey schedule from the transit graph data for the route between the source station and the destination station, the third journey schedule comprising the second departure time from the source station, the first arrival time at the destination station, and one or more third intermediate departure times from the one or more intermediate stations, Wherein the one or more third intermediate departure times are earliest times available to maintain the second departure time from the source station and the first arrival time at the destination station; and the processor configured to present to a user one or more of the first departure time, the first arrival time, the one or more first intermediate departure times, the second departure time, the one or more second intermediate departure times, or the one or more third intermediate departure times. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A computer-program product comprising a non-transitory computer readable storage medium storing computer-readable instructions for transit route planning, the instructions when executed by a processor, cause the processor to perform operations, the operations comprising:
-
determining a first journey schedule for a route between a source station and a destination station, the first journey schedule comprising a first departure time from the source station, a first arrival time at the destination station, and one or more first intermediate departure times from one or more intermediate stations; determining a second journey schedule for the route between the source station and the destination station, the second journey schedule comprising the first arrival time at the destination station, a second departure time from the source station, and one or more second intermediate departure times from the one or more intermediate stations, wherein the second departure time and the one or more second intermediate departure times are latest times available to achieve the first arrival time at the destination station; determining a third journey schedule for the route between the source station and the destination station, the third journey schedule comprising the second departure time from the source station, the first arrival time at the destination station, and one or more third intermediate departure times from the one or more intermediate stations, wherein the one or more third intermediate departure times are earliest times available to maintain the second departure time from the source station and the first arrival time at the destination station; and presenting to a user one or more of the first departure time, the first arrival time, the one or more first intermediate departure times, the second departure time, the one or more second intermediate departure times, or the one or more third intermediate departure times. - View Dependent Claims (15, 16)
-
Specification