01660352

Component

https://doi.org/10.1177/0361198118780706

Combined traffic assignment–signal control equilibrium is usually integrated into a non-cooperative games model between the network authority and road users. Unlike a pure Wardropian equilibrium, in reality there may be both competition and cooperation between authority and users. Authority has always been regarded as the upper level in classical bi-level formulations, but this placement may increase the difficulty of obtaining a global optimal solution between authority and users. This paper proposes a level-change Stackelberg (LC Stackelberg) model that embraces both authority–user and user–authority formulations. The model is calibrated by a model predictive control (MPC) controller. A route-choice probability model is used to estimate flow burden on two parallel routes. Meanwhile, the difference of route-choice probability between the two parallel paths is regarded as the level-change threshold. A generalized autoregressive conditional heteroscedasticity (GJR-GARCH) model is used as a triggering function in the MPC controller to fulfill the level-change procedure. A modified wavelet neural network algorithm is used to seek the global optimal solution. Cournot, Stackelberg, and Monopoly, combined with a fixed-time control policy based on the Webster method, were chosen as benchmarks in a numerical example to test model validity. The results show that the LC Stackelberg model obtains the minimum total travel time compared with other models. Furthermore, the level-change between authority and users could also decrease route choice probability on one specific path, indicating the model’s potential application in urban networks.

18-01632

English

pp 24-35

2018-12

Transportation Research Record: Journal of the Transportation Research Board

Print

Figures (5) ; References (41) ; Tables (1)

Equilibrium (Systems); Heteroscedasticity; Route choice; Traffic assignment; Traffic signal controllers

Stackelberg game

Highways; Operations and Traffic Management; Planning and Forecasting

TRIS, TRB, ATRI

Jan 8 2018 10:25AM

• 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
• 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