A comparative study of some macroscopic link models used in dynamic traffic assignment

DOI10.1007/S11067-005-6663-6MaRDI QIDQ813032zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 30 January 2006

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11067-005-6663-6

zbMATH Keywords

delay-function link modelsDynamic network loadingdynamic traffic assignmentexit-flow function link models

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• Node and link models for network traffic flow simulation
• scientific article; zbMATH DE number 1057920
• Modelling dynamic network loading ontransportation networks through a continuous
• Comparison of methods for path flow reassignment for dynamic user equilibrium
• scientific article; zbMATH DE number 1867324

Cites work

• A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem
• A Dynamic Traffic Assignment Model and a Solution Algorithm
• A linear programming model for the single destination system optimum dynamic traffic assignment problem
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
• Advances in the Continuous Dynamic Network Loading Problem
• Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
• scientific article; zbMATH DE number 1024734 (Why is no real title available?)
• Network economics: a variational inequality approach
• On kinematic waves II. A theory of traffic flow on long crowded roads
• On the existence of solutions to the dynamic user equilibrium problem
• Optimal Time-Varying Flows on Congested Networks

Cited in

(19)

• Node and link models for network traffic flow simulation
• A path-based solution algorithm for dynamic traffic assignment
• Continuity of the effective delay operator for networks based on the link delay model
• Efficient discretisation for link travel time models
• A node model capturing turning lane capacity and physical queuing for the dynamic network loading problem
• Solving traffic queues at controlled-signalized intersections in continuous-time Markov games
• Path-based dynamic user equilibrium model with applications to strategic transportation planning
• A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
• Modeling urban land use change and urban sprawl: Calgary, Alberta, Canada
• A hybrid route choice model for dynamic traffic assignment
• Submission to the DTA2012 special issue: Convergence of time discretization schemes for continuous-time dynamic network loading models
• A comparison of dynamic user optimal states with zero, fixed and variable tolerances
• Submission to the DTA2012 special issue: A case for higher-order traffic flow models in DTA
• scientific article; zbMATH DE number 1057920 (Why is no real title available?)
• On the role of spatial dynamics and topology on network flows
• The morning commute problem with coarse toll and nonidentical commuters
• Modelling dynamic network loading ontransportation networks through a continuous
• Travel time delay model with lane management policy for connected automated vehicles
• Time-dependent trip-chain link travel time estimation model with the first-in-first-out constraint

This page was built for publication: A comparative study of some macroscopic link models used in dynamic traffic assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813032)