A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models

DOI10.1287/opre.41.1.192zbMath0771.90039OpenAlexW2036171539MaRDI QIDQ5288151

David E. Boyce, Bin Ran, Larry J. Le Blanc

Publication date: 9 August 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.1.192

zbMATH Keywords

traffic assignmentcongested transportation networkconvex programs with linear constraints

Mathematics Subject Classification ID

Convex programming (90C25) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Application models in control theory (93C95)

Related Items (22)

A hybrid route choice model for dynamic traffic assignment ⋮ Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review ⋮ A continuous DUE algorithm using the link transmission model ⋮ A comparison of dynamic user optimal states with zero, fixed and variable tolerances ⋮ ANALYSIS OF LANE-BLOCKING EVENTS WITH AN ANALYTICAL DYNAMIC TRAFFIC ASSIGNMENT MODEL ⋮ A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture ⋮ Dynamic traffic assignment: Considerations on some deterministic modelling approaches ⋮ A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium ⋮ System optimal and user equilibrium time-dependent traffic assignment in congested networks ⋮ Discontinuous periodic behaviour in a looped macroscopic model of traffic dynamics ⋮ A trip time model for traffic flow on a semi-closed loop ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum ⋮ Path-based dynamic user equilibrium model with applications to strategic transportation planning ⋮ System dynamics and feedback control problem formulations for real time dynamic traffic routing ⋮ Time-Continuous Instantaneous and Past Memory Routing on Traffic Networks: A Mathematical Analysis on the Basis of the Link-Delay Model ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Dynamic flows with adaptive route choice ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ The analysis of Braess' paradox and robustness based on dynamic traffic assignment models ⋮ Dynamic traffic network model and time-dependent Braess' paradox ⋮ Day-to-day vehicular flow dynamics in intelligent transportation network

This page was built for publication: A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models