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

Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of locally perceived attributes

Author

Listed:
  • Yuki Oyama

Abstract

This study performs an attribute-level analysis of the global and local path preferences of network travelers. To this end, a reward decomposition approach is proposed and integrated into a link-based recursive (Markovian) path choice model. The approach decomposes the instantaneous reward function associated with each state-action pair into the global utility, a function of attributes globally perceived from anywhere in the network, and the local utility, a function of attributes that are only locally perceived from the current state. Only the global utility then enters the value function of each state, representing the future expected utility toward the destination. This global-local path choice model with decomposed reward functions allows us to analyze to what extent and which attributes affect the global and local path choices of agents. Moreover, unlike most adaptive path choice models, the proposed model can be estimated based on revealed path observations (without the information of plans) and as efficiently as deterministic recursive path choice models. The model was applied to the real pedestrian path choice observations in an urban street network where the green view index was extracted as a visual street quality from Google Street View images. The result revealed that pedestrians locally perceive and react to the visual street quality, rather than they have the pre-trip global perception on it. Furthermore, the simulation results using the estimated models suggested the importance of location selection of interventions when policy-related attributes are only locally perceived by travelers.

Suggested Citation

  • 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.
  • Handle: RePEc:arx:papers:2307.08646
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2307.08646
    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. 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.
    3. Ding-Mastera, Jing & Gao, Song & Jenelius, Erik & Rahmani, Mahmood & Ben-Akiva, Moshe, 2019. "A latent-class adaptive routing choice model in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 1-17.
    4. Robin, Th. & Antonini, G. & Bierlaire, M. & Cruz, J., 2009. "Specification, estimation and validation of a pedestrian walking behavior model," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 36-56, January.
    5. Basu, Rounaq & Sevtsuk, Andres, 2022. "How do street attributes affect willingness-to-walk? City-wide pedestrian route choice analysis using big data from Boston and San Francisco," Transportation Research Part A: Policy and Practice, Elsevier, vol. 163(C), pages 1-19.
    6. 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.
    7. Hoogendoorn, S. P. & Bovy, P. H. L., 2004. "Pedestrian route-choice and activity scheduling theory and models," Transportation Research Part B: Methodological, Elsevier, vol. 38(2), pages 169-190, February.
    8. 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.
    9. Antonini, Gianluca & Bierlaire, Michel & Weber, Mats, 2006. "Discrete choice models of pedestrian walking behavior," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 667-687, September.
    10. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    11. Duncan, Lawrence Christopher & Watling, David Paul & Connors, Richard Dominic & Rasmussen, Thomas Kjær & Nielsen, Otto Anker, 2020. "Path Size Logit route choice models: Issues with current models, a new internally consistent approach, and parameter estimation on a large-scale network with GPS data," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 1-40.
    12. 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.
    13. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Mogens Fosgerau & Mads Paulsen & Thomas Kj{ae}r Rasmussen, 2021. "A perturbed utility route choice model," Papers 2103.13784, arXiv.org, revised Sep 2021.
    6. Abdelghany, Ahmed & Abdelghany, Khaled & Mahmassani, Hani, 2016. "A hybrid simulation-assignment modeling framework for crowd dynamics in large-scale pedestrian facilities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 86(C), pages 159-176.
    7. Wang, Shuaian & Zhang, Wei & Qu, Xiaobo, 2018. "Trial-and-error train fare design scheme for addressing boarding/alighting congestion at CBD stations," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 318-335.
    8. Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.
    9. Haghani, Milad & Sarvi, Majid & Shahhoseini, Zahra, 2019. "When ‘push’ does not come to ‘shove’: Revisiting ‘faster is slower’ in collective egress of human crowds," Transportation Research Part A: Policy and Practice, Elsevier, vol. 122(C), pages 51-69.
    10. Haghani, Milad & Sarvi, Majid & Shahhoseini, Zahra, 2015. "Accommodating taste heterogeneity and desired substitution pattern in exit choices of pedestrian crowd evacuees using a mixed nested logit model," Journal of choice modelling, Elsevier, vol. 16(C), pages 58-68.
    11. Austin Knies & Jorge Lorca & Emerson Melo, 2020. "A Recursive Logit Model with Choice Aversion and Its Application to Transportation Networks," Papers 2010.02398, arXiv.org, revised Oct 2021.
    12. Nicholas Molyneaux & Riccardo Scarinci & Michel Bierlaire, 0. "Design and analysis of control strategies for pedestrian flows," Transportation, Springer, vol. 0, pages 1-41.
    13. Hänseler, Flurin S. & Bierlaire, Michel & Farooq, Bilal & Mühlematter, Thomas, 2014. "A macroscopic loading model for time-varying pedestrian flows in public walking areas," Transportation Research Part B: Methodological, Elsevier, vol. 69(C), pages 60-80.
    14. 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.
    15. 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.
    16. Nicholas Molyneaux & Riccardo Scarinci & Michel Bierlaire, 2021. "Design and analysis of control strategies for pedestrian flows," Transportation, Springer, vol. 48(4), pages 1767-1807, August.
    17. 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.
    18. 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.
    19. Knies, Austin & Lorca, Jorge & Melo, Emerson, 2022. "A recursive logit model with choice aversion and its application to transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 47-71.
    20. 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.

    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:2307.08646. 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.