01660394

Component

https://doi.org/10.1177/0361198118774236

This paper presents a new path-based algorithm for the static user equilibrium traffic assignment problem. Path-based algorithms are generally considered less efficient than bush-based counterparts, such as Algorithm B, traffic assignment by paired alternative segments (TAPAS), and iTAPAS, an improved version of TAPAS, because explicitly storing and manipulating paths appears wasteful. However, our numerical experiments indicate that the proposed path-based algorithm can outperform TAPAS or iTAPAS by a wide margin. The proposed algorithm, sharing the same Gauss-Seidel decomposition scheme with existing path-based algorithms, delivered a surprising performance, most likely due to its two main features. First, it adopts a greedy method to solve the restricted subproblem defined on each origin–destination (O-D) pair. Second, instead of sequentially visiting every O-D pair in each iteration, it introduces an intelligent scheme to determine which O-D pairs need more or less work. The proposed algorithm is also more straightforward to implement than bush-based algorithms.

18-03128

English

pp 36-44

2018-12

Transportation Research Record: Journal of the Transportation Research Board

Print

Figures (2) ; References (24) ; Tables (2)

Algorithms; Origin and destination; Traffic assignment

Highways; Operations and Traffic Management; Planning and Forecasting

TRIS, TRB, ATRI

Jan 8 2018 10:45AM

• A Generalized Single-Level Formulation for Origin–Destination Estimation under Stochastic User Equilibrium
• Algorithm to Compute Urban Road Network Resilience
• Balanced Scheduling of School Bus Trips Using a Perfect Matching Heuristic
• Characterization of Taxi Fleet Operational Networks and Vehicle Efficiency: Chicago Case Study
• Impact of Extreme Events on Transportation Infrastructure in Iowa: A Bayesian Network Approach
• Improving Scalability of Generic Online Calibration for Real-Time Dynamic Traffic Assignment Systems
• Level-Change Stackelberg Games Model for the Combined Traffic Assignment–Signal Control Equilibrium on Networks
• Link Transmission Model-Based Linear Programming Formulation for Network Design
• Modeling Day-to-Day Dynamics of Travelers’ Risky Route Choices under the Influence of Predictive Traffic Information
• Multimodal Transportation Network Modeling Based on the Generic Second Order Modeling Approach
• Network Partitioning Algorithms for Solving the Traffic Assignment Problem using a Decomposition Approach
• Optimal Information Provision at Bottleneck Equilibrium with Risk-Averse Travelers