Absorbing Markov Chain Traffic Flow Assignment Using a Dynamic Route Choice Model

2013 ◽  
Vol 48 (3) ◽  
pp. 447-452
Author(s):  
Sohta Itoh ◽  
Eiji Hato
Keyword(s):  
Markov Chain ◽  
Traffic Flow ◽  
Choice Model ◽  
Route Choice ◽  
Absorbing Markov Chain ◽  
Flow Assignment ◽  
Dynamic Route

Dynamic Route Choice Model of Large-Scale Traffic Network

1997 ◽  
Vol 123 (4) ◽  
pp. 276-282 ◽  
Author(s):  
David E. Boyce ◽  
Der-Horng Lee ◽  
Bruce N. Janson ◽  
Stanislaw Berka
Keyword(s):  
Large Scale ◽  
Choice Model ◽  
Route Choice ◽  
Traffic Network ◽  
Dynamic Route

scholarly journals A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Xing Zhao ◽  
Gang Ren ◽  
Chao Fan ◽  
Chen-Zi Ding
Keyword(s):  
Traffic Flow ◽  
Choice Model ◽  
Route Choice ◽  
User Equilibrium ◽  
Transmission Model ◽  
Time Interval ◽  
Signal Design ◽  
Stochastic User Equilibrium ◽  
Cell Transmission Model ◽  
Dynamic Stochastic

This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM) which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

scholarly journals A dynamic route choice model for public transport networks with boarding queues

2013 ◽  
Vol 36 (1) ◽  
pp. 44-61 ◽  
Author(s):  
Valentina Trozzi ◽  
Ioannis Kaparias ◽  
Michael G.H. Bell ◽  
Guido Gentile
Keyword(s):  
Public Transport ◽  
Choice Model ◽  
Route Choice ◽  
Transport Networks ◽  
Dynamic Route

On the age distribution of a Markov chain

1978 ◽  
Vol 15 (1) ◽  
pp. 65-77 ◽  
Author(s):  
Anthony G. Pakes
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Limit Theorems ◽  
Age Distribution ◽  
Weak Limit ◽  
Absorbing State ◽  
Absorbing Markov Chain ◽  
Continuous Random Walk ◽  
A Chain ◽  
Watson Process

This paper develops the notion of the limiting age of an absorbing Markov chain, conditional on the present state. Chains with a single absorbing state {0} are considered and with such a chain can be associated a return chain, obtained by restarting the original chain at a fixed state after each absorption. The limiting age, A(j), is the weak limit of the time given Xn = j (n → ∞).A criterion for the existence of this limit is given and this is shown to be fulfilled in the case of the return chains constructed from the Galton–Watson process and the left-continuous random walk. Limit theorems for A (J) (J → ∞) are given for these examples.

Sign in / Sign up

Export Citation Format

Share Document