An exit-&ow model used in dynamic tra(c assignment (original) (raw)
Malachy CareyRelated papers
An exit-flow model used in dynamic traffic assignment
Computers & Operations Research, 2004
Transportation Research Part B: Methodological, 2014
Behaviour of a whole-link travel time model used in dynamic traffic assignment
Transportation Research Part B: Methodological, 2002
Dynamic Traffic Assignment with More Flexible Modelling within Links
2001
Efficient Discretisation for Link Travel Time Models
Networks and Spatial Economics, 2000
Time and space discretization in dynamic traffic assignment models
Proceedings of the First …, 2006
Dynamic traffic assignment with non separable link cost functions and queue spillovers
Properties of link travel time functions under dynamic loads
Transportation Research Part B: Methodological, 1995
Toward a class of link travel time functions for dynamic assignment models on signalized networks
Transportation Research Part B: Methodological, 1997
Discrete-Time Dynamic Trac Assignment Models with Periodic Planning Horizon: System Optimum
2006
This paper proposes a system optimal dynamic tra-c assignment model that does not require the network to be empty at the beginning or at the end of the planning horizon. The model assumes that link travel times depend on tra-c densities and uses a discretized planning horizon. The resulting formulation is a nonlinear program with binary variables and a time-expanded network structure. Under a relatively mild condition, the nonlinear program has a feasible solution. When necessary, constraints can be added to ensure that the solution satisfles the First-In-First-Out condition. Also included are approximation schemes based on linear integer programs that can provide solutions arbitrarily close to that of the original nonlinear problem.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
On a link-based day-to-day traffic assignment model
Transportation Research Part B: Methodological, 2012
Transportation Research Part B: Methodological, 2007
Link Travel Times II: Properties Derived from Traffic-Flow Models
Networks and Spatial Economics, 2000
Infinite Dimensional Formulations of Some Dynamic Traffic Assignment Models
Advances in Spatial Science, 1998
Quasi-Continuous Dynamic Traffic Assignment Model
Transportation Research Record, 1995
Some consistency conditions for dynamic traffic assignment problems
2005
Continuos dinamic network loading models
Continuous-time point-queue models in dynamic network loading
Transportation Research Part B: Methodological, 2012
The Link Transmission Model for dynamic network loading
A Whole-Link Travel-Time Model with Desirable Properties
Transportation Science, 2003
Spillback modelling in dynamic traffic assignment using implicit path enumeration
Convergence of a Discretised Travel-Time Model
Transportation Science, 2005
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Trac Demands
A Continuous-time Link-based Kinematic Wave Model for Dynamic Traffic Networks
arXiv (Cornell University), 2012
Analytical Dynamic Traffic Assignment Models
Handbooks in Transport, 2007
An approach to modelling time-varying flows on congested networks
Transportation Research Part B: Methodological, 2000
Rafał Kucharski, Daniele Tiddi
Pseudo-periodicity in a travel-time model used in dynamic traffic assignment
Transportation Research Part B: Methodological, 2003
Dealing with Capacity Constraints Within Stochastic User Equilibrium Assignment Models
1970
A Mesoscopic Simulation-Based Dynamic Traffic Assignment Model
Analytical models of the dynamic traffic assignment problem
Networks and Spatial Economics, 2001
MODELLING QUEUES IN STATIC TRAFFIC ASSIGNMENT
Stochastic and deterministic formulations of dynamic traffic assignment
- About
- Press
- Blog
- Papers
- Topics
- We're Hiring!
- Help Center
- Find new research papers in:
- Physics
- Chemistry
- Biology
- Health Sciences
- Ecology
- Earth Sciences
- Cognitive Science
- Mathematics
- Computer Science
- Terms
- Privacy
- Copyright
- Academia ©2024