An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues

DOI10.1287/TRSC.35.4.389.10435MaRDI QIDQ4411202zbMATH OpenOpenAlexFDO

Authors Takashi Akamatsu

Publication date 2001

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e999c5da55d8f0020181579b1c73163f5ce95d3c

zbMATH Keywords

heuristicdynamic user equilibriumNewton's methodnonlinear complementarity problemsassignments

Mathematics Subject Classification ID

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)

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

(22)

• A path-based solution algorithm for dynamic traffic assignment
• scientific article; zbMATH DE number 1867317 (Why is no real title available?)
• A new algorithm for solving user equilibrium and system optimization models
• scientific article; zbMATH DE number 817541 (Why is no real title available?)
• Comparison of methods for path flow reassignment for dynamic user equilibrium
• scientific article; zbMATH DE number 1548193 (Why is no real title available?)
• An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
• Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees
• A combinatorial user optimal dynamic traffic assignment algorithm
• scientific article; zbMATH DE number 1057921 (Why is no real title available?)
• A continuous DUE algorithm using the link transmission model
• A comparison of dynamic user optimal states with zero, fixed and variable tolerances
• Submission to the DTA2012 special issue: Approximating time delays in solving continuous-time dynamic user equilibria
• Tight Analysis of Priority Queuing for Egress Traffic
• scientific article; zbMATH DE number 5733352 (Why is no real title available?)
• Dynamic Atomic Congestion Games with Seasonal Flows
• An efficient algorithm for computing traffic equilibria using TRANSYT model
• Simultaneous departure time/route choices in queuing networks and a novel paradox
• Nash equilibria and the price of anarchy for flows over time
• A diagonalization algorithm for solving the dynamic network user equilibrium traffic assignment model
• The efficiency of greedy best response algorithm in road traffic assignment
• Computing dynamic user equilibria on large-scale networks with software implementation

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)