An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
DOI10.1287/TRSC.35.4.389.10435zbMATH Open1069.90513OpenAlexW2141563056MaRDI QIDQ4411202FDOQ4411202
Publication date: 2001
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e999c5da55d8f0020181579b1c73163f5ce95d3c
Recommendations
- A diagonalization algorithm for solving the dynamic network user equilibrium traffic assignment model
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- A combinatorial user optimal dynamic traffic assignment algorithm
- A continuous DUE algorithm using the link transmission model
- Computing dynamic user equilibrium on large-scale networks without knowing global parameters
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees
- A combinatorial user optimal dynamic traffic assignment algorithm
- Title not available (Why is that?)
- Tight Analysis of Priority Queuing for Egress Traffic
- Title not available (Why is that?)
- Dynamic Atomic Congestion Games with Seasonal Flows
- Simultaneous departure time/route choices in queuing networks and a novel paradox
- A diagonalization algorithm for solving the dynamic network user equilibrium traffic assignment model
- Nash equilibria and the price of anarchy for flows over time
- Title not available (Why is that?)
This page was built for publication: An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411202)