Markovian traffic equilibrium - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2008

Markovian traffic equilibrium

Résumé

We analyse an equilibrium model for traffic networks based on stochastic dynamic programming. In this model passengers move towards their destinatios by a sequential process of arc selection based on a discrete choice model at every intermediaete node in their trip. Route selection is the outcome of this sequential process while network flows correspond to the invariant measures of the underlying Markov chains. The approach may handle different discrete choice models at every node, including the possibility of mixing deterministic and stochastic distribution rules. It can also be used over a multimodal network in order to model the simultaneous selection of mode and route, as well as to treat the case of elastic demands. We establish the existence of a unique equilibrium. We report some numerical experiences comparing different methods.
Fichier principal
Vignette du fichier
stoc.pdf (239.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00446468 , version 1 (27-01-2010)

Identifiants

  • HAL Id : hal-00446468 , version 1

Citer

Jean-Bernard Baillon, Roberto Cominetti. Markovian traffic equilibrium. Mathematical Programming, 2008, 111 (1-2), pp.33-56. ⟨hal-00446468⟩
126 Consultations
709 Téléchargements

Partager

Gmail Facebook X LinkedIn More