Time independent transit routing
First Claim
1. A computer-implemented method for transit route planning, the method comprising:
- receiving information that identifies a start point and an end point in a transit system;
identifying transit routes between the start point and the end point, wherein each of the transit routes has one or more portions and each of the portions has one or more modes of transportation;
calculating a duration, within a daily period of operation, for each transit route in the transit routes, wherein the duration is representative of an amount of time spent getting from the start point to the end point using the transit route, wherein the duration is based on average amounts of time spent riding the modes of transportation in the portions of the transit route and an amount of time spent waiting for the modes of transportation in the portions of the transit route, wherein the representation of the amount of time spent waiting is based on numbers of trips that the modes of transportation make for the portions of the transit route for the daily period of operation, and wherein the duration is calculated based on an amount of time spent riding the modes of transportation for the specified portion, an amount of time spent riding a specified mode of transportation in the modes of transportation, and a number of trips by the specified mode of transportation, without accounting for any specific departure or arrival time and date of individual transit routes; and
identifying, irrespectively of any specific departure or arrival time and date of individual transit routes, an optimal one or more of the transit routes based on the optimal one or more of the transit routes having a shortest duration among the transit routes.
2 Assignments
0 Petitions
Accused Products
Abstract
The subject matter of this specification can be implemented in, among other things, a method that includes receiving information identifying a start point and an end point in a transit system. The method further includes identifying transit routes between the start point and the end point. Each of the transit routes has one or more portions and each of the portions has one or more modes of transportation. The method further includes calculating a duration for each transit route in the transit routes. The duration is based on average amounts of time spent riding the modes of transportation in the portions of the transit route. The duration is based on a representation of an amount of time spent waiting for the modes of transportation in the portions of the transit route. The method further includes identifying one or more of the transit routes as optimal based on having shortest durations.
-
Citations
26 Claims
-
1. A computer-implemented method for transit route planning, the method comprising:
-
receiving information that identifies a start point and an end point in a transit system; identifying transit routes between the start point and the end point, wherein each of the transit routes has one or more portions and each of the portions has one or more modes of transportation; calculating a duration, within a daily period of operation, for each transit route in the transit routes, wherein the duration is representative of an amount of time spent getting from the start point to the end point using the transit route, wherein the duration is based on average amounts of time spent riding the modes of transportation in the portions of the transit route and an amount of time spent waiting for the modes of transportation in the portions of the transit route, wherein the representation of the amount of time spent waiting is based on numbers of trips that the modes of transportation make for the portions of the transit route for the daily period of operation, and wherein the duration is calculated based on an amount of time spent riding the modes of transportation for the specified portion, an amount of time spent riding a specified mode of transportation in the modes of transportation, and a number of trips by the specified mode of transportation, without accounting for any specific departure or arrival time and date of individual transit routes; and identifying, irrespectively of any specific departure or arrival time and date of individual transit routes, an optimal one or more of the transit routes based on the optimal one or more of the transit routes having a shortest duration among the transit routes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented system for transit route planning, the system comprising:
-
a memory that stores data representing transit routes in a transit system, wherein each of the transit routes has one or more portions and each of the portions has one or more modes of transportation; an interface that receives, from a computing device, data that identifies a start point and an end point in the transit system; a route identification module that identifies one or more of the stored transit routes as going from the start point to the end point; a route calculation module that calculates a duration, within a daily period of operation, for each transit route in the identified transit routes, wherein the duration is representative of an amount of time spent getting from the start point to the end point using the transit route, wherein the duration is based on average amounts of time spent riding the modes of transportation in the portions of the transit route and a representation of an amount of time spent waiting for the modes of transportation in the portions of the transit route, wherein the representation of the amount of time spent waiting is based on numbers of trips that the modes of transportation make for the portions of the transit route for the daily period of operation, and wherein the duration is calculated based on an amount of time spent riding the modes of transportation for the specified portion, an amount of time spent riding a specified mode of transportation in the modes of transportation, and a number of trips by the specified mode of transportation, without accounting for any specific departure or arrival time and date of individual transit routes; and a route optimization module that identifies, irrespectively of any specific departure or arrival time and date of individual transit routes, an optimal one or more of the identified transit routes based on the optimal one or more of the identified transit routes having a shortest duration among the transit routes. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer-readable medium comprising instructions that, when executed by a computer, cause the computer to perform a method for transit route planning, the method comprising:
-
receiving information that identifies a start point and an end point in a transit system; identifying transit routes between the start point and the end point, wherein each of the transit routes has one or more portions and each of the portions has one or more modes of transportation; calculating a duration, within the daily period of operation, for each transit route in the transit routes, wherein the duration is representative of an amount of time spent getting from the start point to the end point using the transit route, wherein the duration is based on a representation of an amount of time spent waiting for and riding the modes of transportation in the portions of the transit route the amount of time spent waiting is based on numbers of trips that the modes of transportation make for the portions of the transit route for the daily period of operation, and wherein the duration is calculated based on an amount of time spent riding the modes of transportation for the specified portion, an amount of time spent riding a specified mode of transportation in the modes of transportation, and a number of trips by the specified mode of transportation, without accounting for any specific departure or arrival time and date of individual transit routes; and identifying, irrespectively of any specific departure or arrival time and date of individual transit routes, an optimal one or more of the transit routes based on the optimal one or more of the transit routes having a shortest duration among the transit routes. - View Dependent Claims (18, 19, 20, 21)
-
-
22. A computer-implemented system for transit route planning, the system comprising:
-
a memory that stores data representing transit routes in a transit system, wherein each of the transit routes has one or more portions and each of the portions has one or more modes of transportation; an interface that receives, from a computing device, data that identifies a start point and an end point in the transit system; a route identification module that identifies one or more of the stored transit routes as going from the start point to the end point; a route calculation module that calculates a duration, within a daily period of operation, for each transit route in the identified transit routes, wherein the duration is representative of an amount of time spent getting from the start point to the end point using the transit route, wherein the duration is based on a representation of an amount of time spent waiting for and riding the modes of transportation in the portions of the transit route the amount of time spent waiting is based on numbers of trips that the modes of transportation make for the portions of the transit route for the daily period of operation, and wherein the duration is calculated based on an amount of time spent riding the modes of transportation for the specified portion, an amount of time spent riding a specified mode of transportation in the modes of transportation, and a number of trips by the specified mode of transportation, without accounting for any specific departure or arrival time and date of individual transit routes; and a route optimization module that identifies, irrespectively of any specific departure or arrival time and date of individual transit routes, an optimal one or more of the identified transit routes based on the optimal one or more of the identified transit routes having a shortest duration among the transit routes. - View Dependent Claims (23, 24, 25, 26)
-
Specification