Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325131 
Year of Publication: 
2020
Citation: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 9 [Issue:] 2 [Article No.:] 100004 [Year:] 2020 [Pages:] 1-12
Publisher: 
Elsevier, Amsterdam
Abstract: 
The problem at the heart of this tutorial consists in modeling the path choice behavior of network users. This problem has been extensively studied in transportation science, where it is known as the route choice problem. In this literature, individuals' choice of paths are typically predicted using discrete choice models. This article is a tutorial on a specific category of discrete choice models called recursive, and it makes three main contributions: First, for the purpose of assisting future research on route choice, we provide a comprehensive background on the problem, linking it to different fields including inverse optimization and inverse reinforcement learning. Second, we formally introduce the problem and the recursive modeling idea along with an overview of existing models, their properties and applications. Third, we extensively analyze illustrative examples from different angles so that a novice reader can gain intuition on the problem and the advantages provided by recursive models in comparison to path-based ones.
Subjects: 
Path choice models
Recursive discrete choice models
Inverse optimization
Inverse reinforcement learning
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.