01660453

Component

https://doi.org/10.1177/0361198118774753

This article presents a linear programming formulation to solve the network design problem using the link transmission model (LTM) as the underlying traffic flow model. The original LTM was adapted by incorporating link-sending and receiving flows using linear inequalities. Furthermore, route choice was relaxed, and transfer flow variables were used to model vehicles’ routing decisions within the network. The objective function of the linear program aimed to minimize the total difference between the cumulative vehicle numbers (CVN) at the upstream and at the downstream boundaries of each link subject to flow-conservation and budget constraints. CVN were represented using transfer flows from connected links. The resulting formulation is a linear program that represents a dynamic system optimum traffic flow pattern, embedding the LTM’s network loading procedure. In contrast to the single-destination system optimum dynamic traffic assignment, based on the cell transmission model, the proposed formulation requires considerably fewer decision variables, thus potentially providing a more scalable approach. The proposed formulation was implemented on an example network to illustrate the behavior of the model, and was compared with the cell-based formulation. We show that the model describes free-flow and congested traffic flow states accurately in terms of shock-wave propagation, queuing of vehicles, and optimal total system travel time.

18-06694

English

pp 139-147

2018-12

Transportation Research Record: Journal of the Transportation Research Board

Print

Figures (2) ; References (30) ; Tables (3)

Dynamic traffic assignment; Linear programming; Network links; Travel time

Highways; Operations and Traffic Management; Planning and Forecasting

TRIS, TRB, ATRI

Jan 8 2018 11:44AM

• A Generalized Single-Level Formulation for Origin–Destination Estimation under Stochastic User Equilibrium
• A Greedy Path-Based Algorithm for Traffic Assignment
• 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
• 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