A study of logit assignment which excludes all cyclic flows

Transportation Research Part B: Methodological

Volumn 32B, Issue 6, 1998, Pages 401-412

  Huang, Hai Jun ^a   Bell, Michael G H ^b  

^a BEIHANG UNIVERSITY   (China)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIT ANALYSIS; TRAFFIC FLOW; TRANSPORT NETWORK;

MATHEMATICAL MODELS; MOTOR TRANSPORTATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

LOGIT ASSIGNMENT; STOCHASTIC USER EQUILIBRIUM; VAN VLIET MODEL;

OPERATIONS RESEARCH;

EID: 0032131985     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0191-2615(98)00008-3     Document Type: Article

References (17)

1. Akamatsu, T. (1996) Cyclic flow, Markov process and stochastic traffic assignment. Transportation Research-B 30, 369-386.
2. Akamatsu, T. (1997) Decomposition of path choice entropy in general transport networks. Transportation Science 31, 349-362.
3. de la Barra, T., Pérez, B. and Añez, J. (1993) Multidimensional path search and assignment. In Proceedings of the 21th PTRC Summer Annual Meeting, (pp. 307-319), Manchester, UK.
4. Bell, M. G. H. (1995) Alternative to Dial's logit assignment algorithm. Transportation Research-B 29, 287-295.
5. Bell, M. G. H., Lam, W. H. K., Ploss, G. and Inaudi, D. (1993) Stochastic user equilibrium assignment and iterative balancing. In Proceedings of the 12th International Symposium on Transportation and Traffic Theory, ed. C.F. Daganzo, pp. 427-439, Berkeley, CA. Elsevier, New York.
6. Bell, M. G. H., Lam, W. H. K. and Iida, Y. (1996) A time-dependent multi-class path flow estimator. In Proceedings of the 13th International Symposium on Transportation and Traffic Theory, ed. J.B. Lesort, pp. 173-193, Lyon, France. Elsevier, Oxford.
7. Cascetta, E., Nuzzolo, A., Russo, F. and Vitetta, A. (1996) A modified logit route choice model overcoming path overlapping problems. Specification and some calibration results for interurban networks. In Proceedings of the 13th International Symposium on Transportation and Traffic Theory, ed. J.B. Lesort, pp. 697-711, Lyon, France. Elsevier, Oxford.
8. Chen, M. and Alfa, A. S. (1991) Algorithms for solving Fisk's stochastic traffic assignment model. Transportation Research-B 25, 405-412.
9. Damberg, D., Lundgren, J.T. and Patriksson, M. (1996) An algorithm for the stochastic user equilibrium problem. Transportation Research-B 30, 115-131.
10. Davis, G. A. (1993) Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Research-B 27, 61-75.
11. Dial, R. B. (1971) A probabilistic multipath traffic assignment algorithm which obviates path enumeration. Transportation Research 5, 83-111.
12. Floyd, R. W. (1962) Algorithm 97, shortest path. Communications of ACM 5, 345.
13. Fisk, C. (1980) Some developments in equilibrium traffic assignment. Transportation Research-B 14, 243-255.
14. Huang, H. J. (1995) A combined algorithm for solving and calibrating the stochastic traffic assignment model. Journal of the Operational Research Society 46, 977-987.
15. Powell, W. B. and Sheffi, Y. (1982) The convergence of equilibrium algorithms with predetermined step sizes. Transportation Science 16, 45-55.
16. Van Vliet, D. (1981) Selected node-pair analysis in Dial's assignment algorithm. Transportation Research-B 15, 65-68.
17. Warshall, S. (1962) A theorem on Boolean matrices. Journal of ACM 9, 11-12.