A combinatorial user optimal dynamic traffic assignment algorithm

DOI10.1007/s10479-006-0013-zzbMath1156.90324OpenAlexW1990160277MaRDI QIDQ867558

N. E. Zubov

Publication date: 15 February 2007

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

Full work available at URL: https://doi.org/10.1007/s10479-006-0013-z

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (6)

An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices ⋮ Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system ⋮ Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation ⋮ A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem ⋮ A combinatorial dynamic network trajectory reservation algorithm for connected autonomous vehicles ⋮ Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions

Cites Work

• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
• Optimal Time-Varying Flows on Congested Networks
• A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem

This page was built for publication: A combinatorial user optimal dynamic traffic assignment algorithm