A path-based solution algorithm for dynamic traffic assignment
From MaRDI portal
Publication:1642947
DOI10.1007/s11067-017-9346-1zbMath1390.90241OpenAlexW2715118057MaRDI QIDQ1642947
Caixia Li, Tapabrata Ray, Sreenatha Gopalarao Anavatti
Publication date: 18 June 2018
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-017-9346-1
Queues and service in operations research (90B22) Traffic problems in operations research (90B20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cites Work
- Comparison of methods for path flow reassignment for dynamic user equilibrium
- Some consistency conditions for dynamic traffic assignment problems
- A comparative study of some macroscopic link models used in dynamic traffic assignment
- Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
- Modeling circulation systems in buildings using state dependent queueing models
- Solving the dynamic user optimal assignment problem considering queue spillback
- A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
- Optimal Time-Varying Flows on Congested Networks
This page was built for publication: A path-based solution algorithm for dynamic traffic assignment