An exit-flow model used in dynamic traffic assignment

DOI10.1016/S0305-0548(03)00109-6zbMath1061.90018OpenAlexW1988377679MaRDI QIDQ1885963

Malachy Carey, Mark McCartney

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00109-6

Mathematics Subject Classification ID

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

Related Items (4)

Submission to the DTA2012 special issue: A case for higher-order traffic flow models in DTA ⋮ A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ Randomness in the evacuation route selection of large-scale crowds under emergencies

Cites Work

• Extending and solving a multiperiod congested network flow model
• Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
• Optimal Time-Varying Flows on Congested Networks
• The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time
• Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows
• Shock Waves on the Highway
• On kinematic waves II. A theory of traffic flow on long crowded roads

This page was built for publication: An exit-flow model used in dynamic traffic assignment