01334631

Component

https://doi.org/10.3141/2256-05

http://scholar.google.com...upta&publication_year=2011

Recently, transit agencies have begun opening their route configuration and schedule data to the public, as well as providing online application programming interfaces to real-time bus positions and arrival estimates. On the basis of this infrastructure for providing transit data over the Internet, the authors developed an algorithm to calculate the travel times of K shortest paths in a public transportation network where all wait and travel times were known only in real time. Although there was a large body of work on routing algorithms in transit networks, the authors took cues from an algorithm to find the shortest paths in road networks, called transit node routing. This approach was based on observation of intuitive behavior by humans: when taking transit, travelers looked for a particular set of transfer points that connected transit routes that led from the origin and destination. A lookup table was precomputed of feasible paths between the origin stop of every bus route to the terminus of every other bus route by using the transfer points. This precomputation of paths significantly reduced the computation time and number of real-time arrival requests to transit agency servers, the bottleneck in computing this problem. The computational complexity of the algorithm is linear in real time, and implementation results show that queries from a web server are returned in 3 s in the worst case.

01362484

11-3791

English

pp 34-42

2011

Transportation Research Record: Journal of the Transportation Research Board

9780309222921

Print

Figures (8) ; References (43)

Algorithms; Arrivals and departures; Bus transit; Internet; Origin and destination; Real time information; Schedules; Shortest path algorithms; Transfers

Computation time; Path finding

Data and Information Technology; Operations and Traffic Management; Public Transportation; I70: Traffic and Transport

TRIS, TRB

Feb 17 2011 6:38PM

• Analysis of Weigh-in-Motion Data for Truck Weight Grouping in "Mechanistic–Empirical Pavement Design Guide"
• Automated Quality Assurance Methodology for Archived Transit Data from Automatic Vehicle Location and Passenger Counting Systems
• Axle Load Distribution for Mechanistic–Empirical Pavement Design in North Carolina: Multidimensional Clustering Approach and Decision Tree Development
• Capturing Transportation Infrastructure Performance: Data Availability, Needs, and Challenges
• Centrality Characteristics of Road Network Patterns of Traffic Analysis Zones
• Counting Motorcycles and Estimating Motorcycle Vehicle Miles of Travel
• Detection and Correction of Inductive Loop Detector Sensitivity Errors by Using Gaussian Mixture Models
• Development of Traffic Inputs for "Mechanistic–Empirical Pavement Design Guide" in Michigan
• Development of Traffic Inputs for New "Mechanistic–Empirical Pavement Design Guide": Case Study
• Discriminant Analysis for Assigning Short-Term Counts to Seasonal Adjustment Factor Groupings
• Estimating Route Choice and Travel Time Reliability with Field Observations of Bluetooth Probe Vehicles
• Estimation of Dynamic Traffic Densities for Official Statistics: Combined Use of Data from Global Positioning System and Loop Detectors
• Evaluation of Nonintrusive Technologies for Traffic Detection, Phase 3
• Forecasting Traffic Loads for Mechanistic–Empirical Pavement Design
• Future Scenarios for Traffic Information and Management
• Identifying and Correcting Pulse-Breakup Errors from Freeway Loop Detectors
• Innovative Real-Time Methodology for Detecting Travel Time Outliers on Interstate Highways and Urban Arterials
• Is Usual Share of Commuting Mode Always Greater Than Its Actual Share?
• License Plate Image Binarization Based on Chromatic Information and Fuzzy C-Mean Approach
• Network Stratification Method by Travel Time Variation
• Travel Time Prediction Using k Nearest Neighbor Method with Combined Data from Vehicle Detector System and Automatic Toll Collection System