An approach to modelling time-varying flows on congested networks
- 1 April 2000
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 34 (3) , 157-183
- https://doi.org/10.1016/s0191-2615(99)00019-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Nonconvexity of the dynamic traffic assignment problemPublished by Elsevier ,2002
- The continuous dynamic network loading problem: a mathematical formulation and solution methodTransportation Research Part B: Methodological, 1998
- A model and an algorithm for the dynamic user-optimal route choice problemTransportation Research Part B: Methodological, 1998
- Dynamic user optimal traffic assignment model for many to one travel demandTransportation Research Part B: Methodological, 1995
- System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic NetworkPublished by Springer Nature ,1995
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium ProblemOperations Research, 1993
- Dynamic traffic assignment for urban road networksTransportation Research Part B: Methodological, 1991
- Optimal Time-Varying Flows on Congested NetworksOperations Research, 1987
- Solving embedded generalized network problemsEuropean Journal of Operational Research, 1985
- A Model and an Algorithm for the Dynamic Traffic Assignment ProblemsTransportation Science, 1978