TY - JOUR
T1 - Comparing Route Choice Models for Managed Lane Networks with Multiple Entrances and Exits
AU - Pandey, Venktesh
AU - Boyles, Stephen D.
PY - 2019/10/1
Y1 - 2019/10/1
N2 - Developing an appropriate route choice model for managed lanes with multiple entrances and exits is critical for the success of managed lane planning and operations. This research focuses on route choice models for managed lane networks with stochastic and time-varying tolls and travel times. In the model, a traveler receives real-time information about the tolls and travel times upon arrival at each diverge node and makes a dynamic lane choice decision that minimizes the total expected cost. The online route choice model is formulated as a Markov decision process and solved using a backward recursion algorithm. The model is compared against four other routing models: a binary logit model, a model based on decision routes, a model that chooses paths a priori, and a model with routes chosen randomly. The study also models irrational driver behavior with parameters like driver’s inclination toward making optimal lane choices and preference for certain lanes. Findings show that the expected costs from the routes chosen using the decision route model from the literature are close to the optimal cost with an average percentage error of 0.93%. The binary logit model is shown to have a high average error of 50% in the expected cost when a driver is assumed to behave rationally, but the same model shows optimal prediction for certain irrational driver behaviors. The proposed routing model forms a basis for future work in the area of managed lane pricing and planning.
AB - Developing an appropriate route choice model for managed lanes with multiple entrances and exits is critical for the success of managed lane planning and operations. This research focuses on route choice models for managed lane networks with stochastic and time-varying tolls and travel times. In the model, a traveler receives real-time information about the tolls and travel times upon arrival at each diverge node and makes a dynamic lane choice decision that minimizes the total expected cost. The online route choice model is formulated as a Markov decision process and solved using a backward recursion algorithm. The model is compared against four other routing models: a binary logit model, a model based on decision routes, a model that chooses paths a priori, and a model with routes chosen randomly. The study also models irrational driver behavior with parameters like driver’s inclination toward making optimal lane choices and preference for certain lanes. Findings show that the expected costs from the routes chosen using the decision route model from the literature are close to the optimal cost with an average percentage error of 0.93%. The binary logit model is shown to have a high average error of 50% in the expected cost when a driver is assumed to behave rationally, but the same model shows optimal prediction for certain irrational driver behaviors. The proposed routing model forms a basis for future work in the area of managed lane pricing and planning.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85067829509&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85067829509&origin=inward
U2 - 10.1177/0361198119848706
DO - 10.1177/0361198119848706
M3 - Article
SN - 0361-1981
VL - 2673
SP - 381
EP - 393
JO - Transportation Research Record
JF - Transportation Research Record
IS - 10
ER -