Advances in the Continuous Dynamic Network Loading Problem

DOI10.1287/TRSC.33.4.341MaRDI QIDQ4950865zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 2000

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.33.4.341

zbMATH Keywords

continuous dynamic networktime-varying path flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Dynamic multi-class network loading problem
• A continuous whole-link travel time model with occupancy constraint
• A Study of General Dynamic Network Programs with Arc Time-Delays
• Continuity of the effective delay operator for networks based on the link delay model
• A continuous DUE algorithm using the link transmission model

Cited in

(19)

• Fluid dynamics models and their applications in transportation and pricing
• Comparison of methods for path flow reassignment for dynamic user equilibrium
• A comparative study of some macroscopic link models used in dynamic traffic assignment
• Time-continuous instantaneous and past memory routing on traffic networks: a mathematical analysis on the basis of the link-delay model
• Time-dependent trip-chain link travel time estimation model with the first-in-first-out constraint
• Submission to the DTA2012 special issue: Convergence of time discretization schemes for continuous-time dynamic network loading models
• Continuous and discrete trajectory models for dynamic traffic assignment
• Some consistency conditions for dynamic traffic assignment problems
• Continuity of the effective delay operator for networks based on the link delay model
• A trip time model for traffic flow on a semi-closed loop
• Discontinuous periodic behaviour in a looped macroscopic model of traffic dynamics
• Long-term behavior of dynamic equilibria in fluid queuing networks
• Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram
• Dynamic equilibria in fluid queueing networks
• Nash equilibria and the price of anarchy for flows over time
• A node model capturing turning lane capacity and physical queuing for the dynamic network loading problem
• A continuous whole-link travel time model with occupancy constraint
• Dynamic multi-class network loading problem
• Computing dynamic user equilibria on large-scale networks with software implementation

This page was built for publication: Advances in the Continuous Dynamic Network Loading Problem

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