An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
From MaRDI portal
Publication:4411202
Traffic problems in operations research (90B20) Queues and service in operations research (90B22) Discrete location and assignment (90B80) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Approximation methods and heuristics in mathematical programming (90C59)
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
Cited in
(23)- A path-based solution algorithm for dynamic traffic assignment
- Computing dynamic user equilibria on large-scale networks with software implementation
- The efficiency of greedy best response algorithm in road traffic assignment
- Simultaneous departure time/route choices in queuing networks and a novel paradox
- Comparison of methods for path flow reassignment for dynamic user equilibrium
- A new algorithm for solving user equilibrium and system optimization models
- Tight Analysis of Priority Queuing for Egress Traffic
- Submission to the DTA2012 special issue: Approximating time delays in solving continuous-time dynamic user equilibria
- A continuous DUE algorithm using the link transmission model
- A comparison of dynamic user optimal states with zero, fixed and variable tolerances
- scientific article; zbMATH DE number 5733352 (Why is no real title available?)
- A diagonalization algorithm for solving the dynamic network user equilibrium traffic assignment model
- scientific article; zbMATH DE number 1057915 (Why is no real title available?)
- scientific article; zbMATH DE number 1057921 (Why is no real title available?)
- scientific article; zbMATH DE number 1548193 (Why is no real title available?)
- scientific article; zbMATH DE number 1867317 (Why is no real title available?)
- Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees
- scientific article; zbMATH DE number 817541 (Why is no real title available?)
- Dynamic Atomic Congestion Games with Seasonal Flows
- An efficient algorithm for computing traffic equilibria using TRANSYT model
- Nash equilibria and the price of anarchy for flows over time
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- A combinatorial user optimal dynamic traffic assignment algorithm
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)
