# A Markov chain model for traffic equilibrium problems

RAIRO - Operations Research - Recherche Opérationnelle (2002)

- Volume: 36, Issue: 3, page 209-226
- ISSN: 0399-0559

## Access Full Article

top## Abstract

top## How to cite

topMastroeni, Giandomenico. "A Markov chain model for traffic equilibrium problems." RAIRO - Operations Research - Recherche Opérationnelle 36.3 (2002): 209-226. <http://eudml.org/doc/244950>.

@article{Mastroeni2002,

abstract = {We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous Markov chain, whose stationary distributions (if any) characterize the equilibrium.},

author = {Mastroeni, Giandomenico},

journal = {RAIRO - Operations Research - Recherche Opérationnelle},

keywords = {traffic assignment problems; Markov chains; network flows},

language = {eng},

number = {3},

pages = {209-226},

publisher = {EDP-Sciences},

title = {A Markov chain model for traffic equilibrium problems},

url = {http://eudml.org/doc/244950},

volume = {36},

year = {2002},

}

TY - JOUR

AU - Mastroeni, Giandomenico

TI - A Markov chain model for traffic equilibrium problems

JO - RAIRO - Operations Research - Recherche Opérationnelle

PY - 2002

PB - EDP-Sciences

VL - 36

IS - 3

SP - 209

EP - 226

AB - We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous Markov chain, whose stationary distributions (if any) characterize the equilibrium.

LA - eng

KW - traffic assignment problems; Markov chains; network flows

UR - http://eudml.org/doc/244950

ER -

## References

top- [1] J.A. Barnes and R.L. Disney, Traffic processes in a class of finite Markov queues. Queueing Systems Theory Appl. 9 (1990) 311-326. Zbl0696.60090MR1059239
- [2] R. Bellman, Dynamic Programming. Princeton University Press, Princeton, New Jersey (1957). Zbl0077.13605MR90477
- [3] S. Dafermos, Traffic equilibria and variational inequalities. Math. Programming 26 (1980) 40-47. Zbl0506.65026
- [4] P.T. Harker and J.S. Pang, Finite-Dimensional Variational Inequalities and Nonlinear Complementarity Problem: A Survey of Theory, Algorithms and Appl. Math. Programming 48 (1990) 161-220. Zbl0734.90098MR1073707
- [5] K.J. Hastings, Introduction to the mathematics of operations research. Dekker, New York (1989). Zbl0709.90074MR992197
- [6] M. Iosifescu, Finite Markov Processes and Their Applications. John Wiley and Sons (1980). Zbl0436.60001MR587116
- [7] T. Kurasugi and K. Kobayashi, A Markovian model of coded video traffic which exhibits long-range dependence in statistical analysis. J. Oper. Res. Soc. Japan 42 (1999) 1-17. Zbl0998.90010MR1687929
- [8] J. Kemeni and J. Snell, Finite Markov Chains. Van Nostrand, Princeton, New Jersey (1960). Zbl0089.13704MR115196
- [9] W. Leontief, Environmental Repercussions and the Economic Structure: An Input-Output Approach. Rev. Econom. Statist. 52 (1970).
- [10] G. Mihoc, On General Properties of Dependent Statistical Variables. Bull. Math. Soc. Roumaine Sci. 37 (1935) 37-82. Zbl61.1295.03JFM61.1295.03
- [11] J.F. Nash, Non-Cooperative games. Ann. Math. 54 (1951) 286-295. Zbl0045.08202MR43432
- [12] S. Nguyen and S. Pallottino, Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37 (1988) 176-186. Zbl0649.90049MR963924
- [13] M. Patriksson, Nonlinear Programming and Variational Inequality Problems. Kluwer Academic Publishers, Dordrecht, Boston, London (1999). Zbl0913.65058MR1673631
- [14] E. Seneta, Non-negative Matrices and Markov Chains. Springer Verlag, New York, Heidelberg, Berlin (1981). Zbl0471.60001MR2209438
- [15] J.G. Wardrop, Some Theoretical Aspects of Road Traffic Research, in Proc. of the Institute of Civil Engineers, Part II (1952) 325-378.

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.