A stochastic process approach to the analysis of temporal dynamics in transportation networks
AbstractEquilibrium analyses of transportation networks are by their nature "static," with equilibrium configuration defined as "fixed" or "autoreflexive" points, i.e. flow patterns reproducing themselves on the basis of the assumptions made on users' behavior once reached by the system. In this paper it is argued that no transportation system remains in the same state over successive periods because of the action of several causes (e.g. temporal fluctuation of level and composition of demand, users' choices, and travel costs). This implies that the sequence of states occupied by the system over successive epochs or times of similar characteristics (e.g. peak hour of working days) is the realization of a stochastic process, the type of which depends on, among other things, the choice mechanism followed by travelers. Stationarity of the stochastic process within fixed potential demand and network structures is considered to be a desirable property because it allows a flow pattern distribution to be associated to each demand-network system independently of its starting configuration and elapsed time. Furthermore, this stationarity makes it possible to define expected path and link flows and compare them with those of stochastic user equilibrium (SUE). In this paper rather general sufficient conditions for the process stationarity are given, essentially calling for a "stable" choice mechanism of potential users. In the following a particular model of temporal dynamics (STODYN), based upon a number of simplifying assumptions on users' behavior common to most assignment models, is described. Exact and approximate relationships between STODYN steady-state expected flows and SUE average flows are also analyzed both in the case of unique and multiple equilibria. The possible use of STODYN as an assignment model giving unique average flows along with their variances and covariances is then discussed. The model takes into account stochastic fluctuations of demand and can be easily extended to other "dimensions" such as distribution and modal choice. Some results of an empirical analysis comparing STODYN average flows with SUE and observed flows on two urban car networks are also reported.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 23 (1989)
Issue (Month): 1 (February)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Bie, Jing & Lo, Hong K., 2010. "Stability and attraction domains of traffic equilibria in a day-to-day dynamical system formulation," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 90-107, January.
- Cominetti, Roberto & Melo, Emerson & Sorin, Sylvain, 2010. "A payoff-based learning procedure and its application to traffic games," Games and Economic Behavior, Elsevier, vol. 70(1), pages 71-83, September.
- Liu, Ronghui & Van Vliet, Dirck & Watling, David, 2006. "Microsimulation models incorporating both demand and supply dynamics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(2), pages 125-150, February.
- Watling, David, 1999. "Stability of the stochastic equilibrium assignment problem: a dynamical systems approach," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 281-312, May.
- Watling, David, 1998. "Perturbation stability of the asymmetric stochastic equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 155-171, April.
- Alessandro Innocenti & Patrizia Latturolo & Maria Grazia Pazienza, 2009.
"Heuristics and Biases in Travel Mode Choice,"
0905, SIET Società Italiana di Economia dei Trasporti e della Logistica.
- Alessandro Innocenti & Patrizia Lattarulo & Maria Grazia Pazienza, 2009. "Heuristics and Biases in Travel Mode Choice," Labsi Experimental Economics Laboratory University of Siena 027, University of Siena.
- Hazelton, Martin L., 2000. "Estimation of origin-destination matrices from link flows on uncongested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(7), pages 549-566, September.
- He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
- Lo, H. & Hickman, M. & Walstad, M., 1996. "An Evaluation Taxonomy For Congestion Pricing," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt80g5s1km, Institute of Transportation Studies, UC Berkeley.
- Lo, H. P. & Zhang, N. & Lam, W. H. K., 1999. "Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 369-385, June.
- Hazelton, Martin L., 1998. "Some Remarks on Stochastic User Equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 101-108, February.
- Watling, David, 1996. "Asymmetric problems and stochastic process models of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 339-357, October.
- Guo, Xiaolei & Liu, Henry X., 2011. "Bounded rationality and irreversible network change," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1606-1618.
- Hazelton, Martin L., 2002. "Day-to-day variation in Markovian traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 637-648, August.
If references are entirely missing, you can add them using this form.