IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2204.01215.html
   My bibliography  Save this paper

Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach

Author

Listed:
  • Yuki Oyama

Abstract

Although the recursive logit (RL) model has been recently popular and has led to many applications and extensions, an important numerical issue with respect to the computation of value functions remains unsolved. This issue is particularly significant for model estimation, during which the parameters are updated every iteration and may violate the feasibility condition of the value function. To solve this numerical issue of the value function in the model estimation, this study performs an extensive analysis of a prism-constrained RL (Prism-RL) model proposed by Oyama and Hato (2019), which has a path set constrained by the prism defined based upon a state-extended network representation. The numerical experiments have shown two important properties of the Prism-RL model for parameter estimation. First, the prism-based approach enables estimation regardless of the initial and true parameter values, even in cases where the original RL model cannot be estimated due to the numerical problem. We also successfully captured a positive effect of the presence of street green on pedestrian route choice in a real application. Second, the Prism-RL model achieved better fit and prediction performance than the RL model, by implicitly restricting paths with large detour or many loops. Defining the prism-based path set in a data-oriented manner, we demonstrated the possibility of the Prism-RL model describing more realistic route choice behavior. The capture of positive network attributes while retaining the diversity of path alternatives is important in many applications such as pedestrian route choice and sequential destination choice behavior, and thus the prism-based approach significantly extends the practical applicability of the RL model.

Suggested Citation

  • Yuki Oyama, 2022. "Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach," Papers 2204.01215, arXiv.org, revised Jan 2023.
  • Handle: RePEc:arx:papers:2204.01215
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2204.01215
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Rust, John, 1987. "Optimal Replacement of GMC Bus Engines: An Empirical Model of Harold Zurcher," Econometrica, Econometric Society, vol. 55(5), pages 999-1033, September.
    2. Fosgerau, Mogens & Frejinger, Emma & Karlstrom, Anders, 2013. "A link based network route choice model with unrestricted choice set," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 70-80.
    3. Mai, Tien & Fosgerau, Mogens & Frejinger, Emma, 2015. "A nested recursive logit model for route choice analysis," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 100-112.
    4. Oyama, Yuki & Hara, Yusuke & Akamatsu, Takashi, 2022. "Markovian traffic equilibrium assignment based on network generalized extreme value model," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 135-159.
    5. Boeing, Geoff, 2017. "OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks," SocArXiv q86sd, Center for Open Science.
    6. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    7. Meyer de Freitas, Lucas & Becker, Henrik & Zimmermann, Maëlle & Axhausen, Kay W., 2019. "Modelling intermodal travel in Switzerland: A recursive logit approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 200-213.
    8. Kitamura, Ryuichi, 1984. "Incorporating trip chaining into analysis of destination choice," Transportation Research Part B: Methodological, Elsevier, vol. 18(1), pages 67-81, February.
    9. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    10. Mai, Tien, 2016. "A method of integrating correlation structures for a generalized recursive route choice model," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 146-161.
    11. van Oijen, Tim P. & Daamen, Winnie & Hoogendoorn, Serge P., 2020. "Estimation of a recursive link-based logit model and link flows in a sensor equipped network," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 262-281.
    12. Tien Mai & Fabian Bastin & Emma Frejinger, 2018. "A decomposition method for estimating recursive logit based route choice models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 253-275, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Oyama, Yuki & Murakami, Soichiro & Chikaraishi, Makoto & Parady, Giancarlos, 2024. "Designing pedestrian zones within city center networks considering policy objective trade-offs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 185(C).
    2. Oyama, Yuki, 2024. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of visually perceived attributes," Transportation Research Part A: Policy and Practice, Elsevier, vol. 181(C).
    3. Yuki Oyama, 2023. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of locally perceived attributes," Papers 2307.08646, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Oyama, Yuki & Hara, Yusuke & Akamatsu, Takashi, 2022. "Markovian traffic equilibrium assignment based on network generalized extreme value model," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 135-159.
    2. Yuki Oyama, 2023. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of locally perceived attributes," Papers 2307.08646, arXiv.org.
    3. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    4. Oyama, Yuki, 2024. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of visually perceived attributes," Transportation Research Part A: Policy and Practice, Elsevier, vol. 181(C).
    5. Mai, Tien & Bui, The Viet & Nguyen, Quoc Phong & Le, Tho V., 2023. "Estimation of recursive route choice models with incomplete trip observations," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 313-331.
    6. Mai, Tien & Yu, Xinlian & Gao, Song & Frejinger, Emma, 2021. "Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 42-58.
    7. Tran, Hung & Mai, Tien, 2024. "Network-based representations and dynamic discrete choice models for multiple discrete choice analysis," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    8. Tien Mai & The Viet Bui & Quoc Phong Nguyen & Tho V. Le, 2022. "Estimation of Recursive Route Choice Models with Incomplete Trip Observations," Papers 2204.12992, arXiv.org.
    9. Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.
    10. Hung Tran & Tien Mai, 2023. "Network-based Representations and Dynamic Discrete Choice Models for Multiple Discrete Choice Analysis," Papers 2306.04606, arXiv.org.
    11. Oskar Blom Västberg & Anders Karlström & Daniel Jonsson & Marcus Sundberg, 2020. "A Dynamic Discrete Choice Activity-Based Travel Demand Model," Transportation Science, INFORMS, vol. 54(1), pages 21-41, January.
    12. Mai, Tien & Frejinger, Emma & Fosgerau, Mogens & Bastin, Fabian, 2017. "A dynamic programming approach for quickly estimating large network-based MEV models," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 179-197.
    13. Song, Yuchen & Li, Dawei & Liu, Dongjie & Cao, Qi & Chen, Junlan & Ren, Gang & Tang, Xiaoyong, 2022. "Modeling activity-travel behavior under a dynamic discrete choice framework with unobserved heterogeneity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    14. Mai, Tien & Bastin, Fabian & Frejinger, Emma, 2017. "On the similarities between random regret minimization and mother logit: The case of recursive route choice models," Journal of choice modelling, Elsevier, vol. 23(C), pages 21-33.
    15. Mogens Fosgerau & Nikolaj Nielsen & Mads Paulsen & Thomas Kj{ae}r Rasmussen & Rui Yao, 2024. "Substitution in the perturbed utility route choice model," Papers 2409.08347, arXiv.org.
    16. Zhang, Pujun & Lei, Dazhou & Liu, Shan & Jiang, Hai, 2024. "Recursive logit-based meta-inverse reinforcement learning for driver-preferred route planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    17. Mogens Fosgerau & Mads Paulsen & Thomas Kj{ae}r Rasmussen, 2021. "A perturbed utility route choice model," Papers 2103.13784, arXiv.org, revised Sep 2021.
    18. Meyer de Freitas, Lucas & Becker, Henrik & Zimmermann, Maëlle & Axhausen, Kay W., 2019. "Modelling intermodal travel in Switzerland: A recursive logit approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 200-213.
    19. Cortés, Cristián E. & Donoso, Pedro & Gutiérrez, Leonel & Herl, Daniel & Muñoz, Diego, 2023. "A recursive stochastic transit equilibrium model estimated using passive data from Santiago, Chile," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    20. Mai, Tien & Fosgerau, Mogens & Frejinger, Emma, 2015. "A nested recursive logit model for route choice analysis," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 100-112.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2204.01215. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.