Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms

Tien Mai () and Emma Frejinger ()
Additional contact information
Tien Mai: School of Computing and Information Systems, Singapore Management University, Singapore 188065
Emma Frejinger: Department of Computer Science and Operations Research, Université de Montréal and Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Montreal, G1V 0A6 Quebec, Canada

Transportation Science, 2022, vol. 56, issue 6, 1469-1482

Abstract: Traffic flow predictions are central to a wealth of problems in transportation. Path choice models can be used for this purpose, and in state-of-the-art models—so-called recursive path choice (RPC) models—the choice of a path is formulated as a sequential arc choice process using undiscounted Markov decision process (MDP) with an absorbing state. The MDP has a utility maximization objective with unknown parameters that are estimated based on data. The estimation and prediction using RPC models require repeatedly solving value functions that are solutions to the Bellman equation. Although there are several examples of successful applications of RPC models in the literature, the convergence of the value iteration method has not been studied. We aim to address this gap. For the two closed-form models in the literature—recursive logit (RL) and nested recursive logit (NRL)—we study the convergence properties of the value iteration method. In the case of the RL model, we show that the operator associated with the Bellman equation is a contraction under certain assumptions on the parameter values. On the contrary, the operator in the NRL case is not a contraction. Focusing on the latter, we study two algorithms designed to improve upon the basic value iteration method. Extensive numerical results based on two real data sets show that the least squares approach we propose outperforms two value iteration methods.

Keywords: route choice modeling; traffic flow forecasting; nested recursive logit; value iteration method; least squares method (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2022.1145 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:56:y:2022:i:6:p:1469-1482

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().