Cyclic flows, Markov process and stochastic traffic assignment
- 1 October 1996
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 30 (5) , 369-386
- https://doi.org/10.1016/0191-2615(96)00003-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An efficient approach to solving the road network equilibrium traffic assignment problemPublished by Elsevier ,2002
- Alternatives to Dial's logit assignment algorithmTransportation Research Part B: Methodological, 1995
- Exact local solution of the continuous network design problem via stochastic user equilibrium assignmentTransportation Research Part B: Methodological, 1994
- The problem of cyclic flows in traffic assignmentTransportation Research Part B: Methodological, 1987
- Unconstrained Extremal Formulation of Some Transportation Equilibrium ProblemsTransportation Science, 1982
- The Convergence of Equilibrium Algorithms with Predetermined Step SizesTransportation Science, 1982
- Some developments in equilibrium traffic assignmentTransportation Research Part B: Methodological, 1980
- On Stochastic Models of Traffic AssignmentTransportation Science, 1977
- On the probabilistic origin of dial's multipath traffic assignment modelTransportation Research, 1976
- A probabilistic multipath traffic assignment model which obviates path enumerationTransportation Research, 1971