A Markov chain model for traffic equilibrium problems

Giandomenico Mastroeni

RAIRO - Operations Research (2010)

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

Abstract

top
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.

How to cite

top

Mastroeni, Giandomenico. "A Markov chain model for traffic equilibrium problems." RAIRO - Operations Research 36.3 (2010): 209-226. <http://eudml.org/doc/105271>.

@article{Mastroeni2010,
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},
keywords = {Traffic assignment problems; Markov chains; network flows.; traffic assignment problems; network flows},
language = {eng},
month = {3},
number = {3},
pages = {209-226},
publisher = {EDP Sciences},
title = {A Markov chain model for traffic equilibrium problems},
url = {http://eudml.org/doc/105271},
volume = {36},
year = {2010},
}

TY - JOUR
AU - Mastroeni, Giandomenico
TI - A Markov chain model for traffic equilibrium problems
JO - RAIRO - Operations Research
DA - 2010/3//
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.; traffic assignment problems; network flows
UR - http://eudml.org/doc/105271
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.  
  2. R. Bellman, Dynamic Programming. Princeton University Press, Princeton, New Jersey (1957).  
  3. S. Dafermos, Traffic equilibria and variational inequalities. Math. Programming26 (1980) 40-47.  
  4. P.T. Harker and J.S. Pang, Finite-Dimensional Variational Inequalities and Nonlinear Complementarity Problem: A Survey of Theory, Algorithms and Appl. Math. Programming48 (1990) 161-220.  
  5. K.J. Hastings, Introduction to the mathematics of operations research. Dekker, New York (1989).  
  6. M. Iosifescu, Finite Markov Processes and Their Applications. John Wiley and Sons (1980).  
  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. Japan42 (1999) 1-17.  
  8. J. Kemeni and J. Snell, Finite Markov Chains. Van Nostrand, Princeton, New Jersey (1960).  
  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.  
  11. J.F. Nash, Non-Cooperative games. Ann. Math.54 (1951) 286-295.  
  12. S. Nguyen and S. Pallottino, Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res.37 (1988) 176-186.  
  13. M. Patriksson, Nonlinear Programming and Variational Inequality Problems. Kluwer Academic Publishers, Dordrecht, Boston, London (1999).  
  14. E. Seneta, Non-negative Matrices and Markov Chains. Springer Verlag, New York,Heidelberg, Berlin (1981).  
  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 ?

top

You must be logged in to post comments.

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

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.