Markovian traffic equilibrium

Mathematical Programming

Volumn 111, Issue 1-2, 2008, Pages 33-56

  Baillon, J B ^a   Cominetti, R ^b  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Numerical computation; Stochastic assignment; Traffic equilibrium; Variational formulations

Indexed keywords

COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION; STOCHASTIC MODELS;

NUMERICAL COMPUTATION; STOCHASTIC ASSIGNMENT; TRAFFIC EQUILIBRIUM; VARIATIONAL FORMULATIONS;

TELECOMMUNICATION TRAFFIC;

EID: 34347221602     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0076-2     Document Type: Conference Paper

References (31)

1. Ahuja, R.K., Magnanti, Th.L., Orlin, J.B.: Network flows. In: Nemhauser, G.L. et al (eds.) Handbooks in Operations Research and Management Science, Vol. 1 Optimization, pp. 211-369. North-Holland, Amsterdam (1989)
2. Akamatsu, T.: Cyclic flows, Markov processes and stochastic traffic assignment. Transport. Res. B 30(5), 369-386 (1996)
3. Akamatsu, T.: Decomposition of path choice entropy in general transportation networks. Transport. Sci. 31, 349-362 (1997)
4. Alvarez, F., Bolte, J., Brahic, O.: Hessian Riemannian gradient flows in convex programming. SIAM J. Control Optim. 43(2), 477-501 (2004)
5. Beckman, M., McGuire, C., Winsten, C.: Studies in Economics of Transportation. Yale University Press, New Haven (1956)
6. Bell, M.G.H.: Alternatives to dial's logit assignment algorithm. Transport. Res. 29B(4), 287-296 (1995)
7. Ben-Akiva, M.E., Lerman, S.R.: Discrete Choice Analysis: Theory and Application to Travel Demand. MIT Press, Cambridge (1985)
8. Cantarella, G., Cascetta, E.: Dynamic processes and equilibrium in transportation networks: towards a unifying theory. Transport. Sci. 29, 305-329 (1995)
9. Cascetta, E.: A stochastic process approach to the analysis of temporal dynamics in transportation networks. Transport. Res. 23B, 1-17 (1989)
10. Daganzo, C.F.: Multinomial Probit: the Theory and Its Applications to Demand Forecasting. Academic Press, New York (1979)
11. Daganzo, C.F.: Unconstrained extremal formulation of some transportation equilibrium problems. Transport. Sci. 16, 332-360 (1982)
12. Daganzo, C.F., Sheffi, Y.: On stochastic models of traffic assignment. Transport. Sci. 11, 253-274 (1977)
13. Dial, R.B.: A probabilistic multipath traffic assignment model which obviates path enumeration. Transport. Res. 5, 83-111 (1971)
14. Fisk, C.: Some developments in equilibrium traffic assignment. Transport. Res. 14B, 243-255 (1980)
15. Florian, M., Hearn, D.: Network equilibrium models and algorithms. In: Hall, M.O. et al. (eds.) Handbooks in Operation Research and Management Science, Vol. 8, Chapter 6. North Holland, Amsterdam (1995)
16. Florian, M., Hearn, D.: Network equilibrium and pricing. In: Hall, R.W. (ed.) Handbook of Transportation Science, pp. 361-393. Kluwer, Norwell (1999)
17. Fukushima, M.: On the dual approach to the traffic assignment problem. Transport. Res. B 18(3), 235-245 (1984)
18. Hazelton, M.L.: Day-to-day variation in Markovian traffic assignment models. Transport. Res. B 36, 637-648 (2002)
19. Larsson, T., Liu, Z., Patriksson, M.: A dual scheme for traffic assignment problems. Optimization 42(4), 323-358 (1997)
20. Leurent, F.M.: Contribution to logit assignment model. Transport. Res. Rec. 1493, 207-212 (1996)
21. Maher, M.: Algorithms for logit-based stochastic user equilibrium assignment. Transport. Res. B 32, 539-549 (1998)
22. Mastroenni, G.: A Markov chain model for traffic equilibrium problems. RAIRO Oper. Res. 36, 209-226 (2002)
23. Miyagi, T.: On the formulation of a stochastic user equilibrium model consistent with random utility theory. In: Proceedings of the 4th World Conference for Transportation Research, pp.1619-1635 (1985)
24. San Martfn, J.: Personal communication (2003)
25. Sheffi, Y., Powell, W.: An algorithm for the equilibrium assignment with random link times. Networks 12, 191-207 (1982)
26. Sheffi, Y., Daganzo, C.F.: Another paradox of traffic flow. Transport. Res. 12, 43-46 (1978)
27. Shor, N.Z.: Minimization methods for non-differentiable functions. Springer Series in Computational Mathematics, Springer, Berlin Heidelberg New York (1985)
28. Trahan, M.: Probabilistic assignment: an algorithm. Transport. Sci. 8, 311-320 (1974)
29. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers Part II, pp. 325-378 (1952)
30. Watling, D.P., Hazelton, M.L.: The dynamics and equilibria of day-to-day assignment models. Netwo. Spatial Econ. 3, 349-370 (2003)
31. Williams, H.C.W.L.: On the formulation of travel demand models and economic evaluation measures of user benefit. Environ. Plann. A 9, 285-344 (1977)