scholarly journals Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm

2021 ◽  
Vol 151 ◽  
pp. 42-58
Author(s):  
Tien Mai ◽  
Xinlian Yu ◽  
Song Gao ◽  
Emma Frejinger
2014 ◽  
Vol 587-589 ◽  
pp. 1854-1857
Author(s):  
Yi Yong Pan

This paper addresses adaptive reliable shortest path problem which aims to find adaptive en-route guidance to maximize the reliability of arriving on time in stochastic networks. Such routing policy helps travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. In order to reflect the stochastic characteristic of travel times, a traffic network is modeled as a discrete stochastic network. Adaptive reliable shortest path problem is uniformly defined in a stochastic network. Bellman’s Principle that is the core of dynamic programming is showed to be valid if the adaptive reliable shortest path is defined by optimal-reliable routing policy. A successive approximations algorithm is developed to solve adaptive reliable shortest path problem. Numerical results show that the proposed algorithm is valid using typical transportation networks.


Author(s):  
Jing Ding ◽  
Song Gao ◽  
Erik Jenelius ◽  
Mahmood Rahmani ◽  
He Huang ◽  
...  

2008 ◽  
Vol 2085 (1) ◽  
pp. 136-143 ◽  
Author(s):  
Song Gao ◽  
Emma Frejinger ◽  
Moshe Ben-Akiva

Adaptive route choice models are studied that explicitly capture travelers’ route choice adjustments according to information on realized network conditions in stochastic time-dependent networks. Two types of adaptive route choice models are explored: an adaptive path model in which a sequence of path choice models are applied at intermediate decision nodes and a routing policy choice model in which the alternatives correspond to routing policies rather than paths at the origin. A routing policy in this study is a decision rule that maps from all possible pairs (e.g., node, time) to the next links out of the node. Existing route choice models that can be estimated on disaggregate revealed preferences assume a deterministic network setting from the traveler's perspective and cannot capture the traveler's proactive adaptive behavior under uncertain traffic conditions. The literature includes a number of algorithmic studies of optimal routing policy problems, but the estimation of a routing policy choice model is a new research area. The specifications of estimating the two adaptive route choice models are established and the feasibility of estimation from path observations is demonstrated on an illustrative network. Prediction results from three models–nonadaptive path model, adaptive path model, and routing policy model–are compared. The routing policy model is shown to better capture the option value of diversion than the adaptive path model. The difference between the two adaptive models and the nonadaptive model is larger in terms of expected travel time if the network is more stochastic, indicating that the benefit of adaptivity is more significant in a more unpredictable network.


THERMOPEDIA ◽  
2008 ◽  
Author(s):  
Pedro J. Coelho
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document