01514937

Component

https://doi.org/10.3141/2466-09

Transportation systems are inherently uncertain because of random disruptions; nevertheless, real-time information can help travelers make better route choices under such disruptions. The first revealed-preference study of routing policy choice is presented. A "routing policy" is defined as a decision rule applied at each link that maps possible realized traffic conditions to decisions to be made on the link next. The policy represents a traveler’s ability to incorporate real-time information not yet available at the time of decision. Two case studies are conducted in Stockholm, Sweden, and in Singapore. Data for the underlying stochastic time-dependent network are generated from taxi GPS traces through map-matching and nonparametric link travel time estimation. An efficient algorithm to find the optimal routing policy in large-scale networks is first presented, which is a building block of any routing policy choice set generation method. The routing policy choice sets are then generated by link elimination and simulation. The generated choice sets are first evaluated on the basis of whether they include the observed traces on a specific day, or coverage. The sets are then evaluated on the basis of "adaptiveness," defined as the capability of a routing policy to be realized as different paths over different days. A combination of link elimination and simulation methods yields satisfactory coverage. The comparison with a path choice set benchmark also suggests that a routing policy choice set could potentially provide better coverage and capture the adaptive nature of route choice.

01557688

14-1732

English

pp 76–86

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295581

Print

Figures (4) ; Maps; References (41) ; Tables (2)

Case studies; Global Positioning System; Real time information; Revealed preferences; Route choice; Time dependence; Travel time; Traveler information and communication systems

Singapore; Stockholm (Sweden)

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 27 2014 2:37PM

• Access and Connectivity Trade-Offs in Transit Stop Location
• Capacitated Centralized Carrier Collaboration Multihub Location Problem: Tabu Search Approach
• Capacity Estimation in Support of Mesoscopic Simulation as Part of Dynamic Traffic Assignment Models
• Dual-Route Distribution Strategy with Supply Chain Disruption
• High-Speed Train Network Routing with Column Generation
• Initializing the Traffic Assignment Problem by Zone Aggregation and Disaggregation
• Modeling Corridor and Growth Pole Coevolution in Regional Transportation Network
• Modeling Network Growth with Scaling Laws in a Linear Monocentric City
• Park-and-Ride Network Equilibrium with Heterogeneous Commuters and Parking Space Constraint
• Properties of Dynamic Freeway Network Flexibility Model
• Simulation Framework for Modeling Large-Scale Flexible Transit Systems
• Subnetwork Analysis for Dynamic Traffic Assignment Models: Strategy for Estimating Demand at Subnetwork Boundaries
• Transit Route Design Solved with Wireless Data Collection Algorithms
• Travel Time Distribution Under Interrupted Flow and Application to Travel Time Reliability
• Two-Step Approach for Correction of Seed Matrix in Dynamic Demand Estimation
• Unified Route Choice Framework: Specification and Application to Urban Traffic Control