An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues

DOI10.1287/trsc.35.4.389.10435zbMath1069.90513OpenAlexW2141563056MaRDI QIDQ4411202

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

Newton's methodheuristicnonlinear complementarity problemsdynamic user equilibriumassignments

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)

Related Items (3)

Simultaneous departure time/route choices in queuing networks and a novel paradox ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Dynamic Atomic Congestion Games with Seasonal Flows

This page was built for publication: An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues