Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm
We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ ad...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6215 https://ink.library.smu.edu.sg/context/sis_research/article/7218/viewcontent/RoutingPolicyChoice_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-7218 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-72182022-02-23T07:48:58Z Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm MAI, Tien YU, Xinlian GAO, Song FREJINGER, Emma We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until the destination (a.k.a. value function that is a solution to a dynamic programming problem). Existing recursive route choice models and the corresponding solution approaches are based on the assumption that network attributes are deterministic. Hence, they cannot be applied to stochastic networks which are the focus of this paper.We propose an efficient algorithm for solving the value function and its gradient, critical for parameter estimation. It is based on partitioning the state space and decomposing costly matrix operations into a series of simpler ones. We present numerical results using a synthetic network and a network in Stockholm, Sweden. The estimation running time has a 20-30 times speed-up due to matrix decomposition. The estimated model parameters have realistic interpretations. Specifically, travelers are more likely to be adaptive to realized travel times during a longer trip, and more sensitive to travel time when travel time variability is higher. The STD-RL model performs better in predicting route choices than the RL model in a corresponding static and deterministic network. 2021-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6215 info:doi/10.1016/j.trb.2021.06.016 https://ink.library.smu.edu.sg/context/sis_research/article/7218/viewcontent/RoutingPolicyChoice_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Routing policy choice Stochastic time-dependent networks Recursive logit Decomposition algorithm Operations Research, Systems Engineering and Industrial Engineering Theory and Algorithms Transportation |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Routing policy choice Stochastic time-dependent networks Recursive logit Decomposition algorithm Operations Research, Systems Engineering and Industrial Engineering Theory and Algorithms Transportation |
spellingShingle |
Routing policy choice Stochastic time-dependent networks Recursive logit Decomposition algorithm Operations Research, Systems Engineering and Industrial Engineering Theory and Algorithms Transportation MAI, Tien YU, Xinlian GAO, Song FREJINGER, Emma Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
description |
We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until the destination (a.k.a. value function that is a solution to a dynamic programming problem). Existing recursive route choice models and the corresponding solution approaches are based on the assumption that network attributes are deterministic. Hence, they cannot be applied to stochastic networks which are the focus of this paper.We propose an efficient algorithm for solving the value function and its gradient, critical for parameter estimation. It is based on partitioning the state space and decomposing costly matrix operations into a series of simpler ones. We present numerical results using a synthetic network and a network in Stockholm, Sweden. The estimation running time has a 20-30 times speed-up due to matrix decomposition. The estimated model parameters have realistic interpretations. Specifically, travelers are more likely to be adaptive to realized travel times during a longer trip, and more sensitive to travel time when travel time variability is higher. The STD-RL model performs better in predicting route choices than the RL model in a corresponding static and deterministic network. |
format |
text |
author |
MAI, Tien YU, Xinlian GAO, Song FREJINGER, Emma |
author_facet |
MAI, Tien YU, Xinlian GAO, Song FREJINGER, Emma |
author_sort |
MAI, Tien |
title |
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
title_short |
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
title_full |
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
title_fullStr |
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
title_full_unstemmed |
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm |
title_sort |
routing policy choice prediction in a stochastic network: recursive model and solution algorithm |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2021 |
url |
https://ink.library.smu.edu.sg/sis_research/6215 https://ink.library.smu.edu.sg/context/sis_research/article/7218/viewcontent/RoutingPolicyChoice_av.pdf |
_version_ |
1770575892871905280 |