IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v47y2020i1d10.1007_s11116-017-9849-0.html
   My bibliography  Save this article

Operational route choice methodologies for practical applications

Author

Listed:
  • Evanthia Kazagli

    (École Polytechnique Fédérale de Lausanne (EPFL))

  • Michel Bierlaire

    (École Polytechnique Fédérale de Lausanne (EPFL))

  • Matthieu de Lapparent

    (University of Applied Sciences and Arts Western Switzerland (HES-SO))

Abstract

This paper focuses on the application of tractable route choice models and presents a set of methods for deriving relevant disaggregate and aggregate route choice indicators, namely link and route flows. Tractability is achieved at the disaggregate level by the recursive logit model and at the aggregate level by the mental representation item ($$\mathrm {MRI}$$MRI) approach. These two approaches are analyzed here, and extensions of the $${\mathrm {MRI}}$$MRI approach are presented. The analysis elaborates on the features of each model and allows to draw insights into the use of a specific model, depending on the needs of the application and the data availability. The performance of the two models is tested on real data. The results demonstrate the validity of the $${\mathrm {MRI}}$$MRI model that is intended for aggregate analysis.

Suggested Citation

  • Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.
    • Handle: RePEc:kap:transp:v:47:y:2020:i:1:d:10.1007_s11116-017-9849-0
    DOI: 10.1007/s11116-017-9849-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11116-017-9849-0
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11116-017-9849-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. van der Zijpp, N.J. & Fiorenzo Catalano, S., 2005. "Path enumeration by finding the constrained K-shortest paths," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 545-563, July.
    4. Kazagli, Evanthia & Bierlaire, Michel & Flötteröd, Gunnar, 2016. "Revisiting the route choice problem: A modeling framework based on mental representations," Journal of choice modelling, Elsevier, vol. 19(C), pages 1-23.
    5. Azevedo, JoseAugusto & Santos Costa, Maria Emilia O. & Silvestre Madeira, Joaquim Joao E. R. & Vieira Martins, Ernesto Q., 1993. "An algorithm for the ranking of shortest paths," European Journal of Operational Research, Elsevier, vol. 69(1), pages 97-106, August.
    6. Frejinger, E. & Bierlaire, M. & Ben-Akiva, M., 2009. "Sampling of alternatives for route choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 984-994, December.
    7. Shlomo Bekhor & Moshe Ben-Akiva & M. Ramming, 2006. "Evaluation of choice set generation algorithms for route choice models," Annals of Operations Research, Springer, vol. 144(1), pages 235-247, April.
    8. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    9. Lai, Xinjun & Bierlaire, Michel, 2015. "Specification of the cross-nested logit model with sampling of alternatives for route choice models," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 220-234.
    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. Flötteröd, Gunnar & Bierlaire, Michel, 2013. "Metropolis–Hastings sampling of paths," Transportation Research Part B: Methodological, Elsevier, vol. 48(C), pages 53-66.
    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 & 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.

    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. Kazagli, Evanthia & Bierlaire, Michel & Flötteröd, Gunnar, 2016. "Revisiting the route choice problem: A modeling framework based on mental representations," Journal of choice modelling, Elsevier, vol. 19(C), pages 1-23.
    2. Yao, Rui & Bekhor, Shlomo, 2022. "A variational autoencoder approach for choice set generation and implicit perception of alternatives in choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 273-294.
    3. Papola, Andrea & Tinessa, Fiore & Marzano, Vittorio, 2018. "Application of the Combination of Random Utility Models (CoRUM) to route choice," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 304-326.
    4. 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.
    5. Li, Dawei & Feng, Siqi & Song, Yuchen & Lai, Xinjun & Bekhor, Shlomo, 2023. "Asymmetric closed-form route choice models: Formulations and comparative applications," Transportation Research Part A: Policy and Practice, Elsevier, vol. 171(C).
    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. Hamzeh Alizadeh & Bilal Farooq & Catherine Morency & Nicolas Saunier, 2018. "On the role of bridges as anchor points in route choice modeling," Transportation, Springer, vol. 45(5), pages 1181-1206, September.
    8. 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.
    9. 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.
    10. Selin Damla Ahipaşaoğlu & Uğur Arıkan & Karthik Natarajan, 2019. "Distributionally Robust Markovian Traffic Equilibrium," Transportation Science, INFORMS, vol. 53(6), pages 1546-1562, November.
    11. 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.
    12. 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.
    13. 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.
    14. Rasmussen, Thomas Kjær & Watling, David Paul & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 146-165.
    15. 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.
    16. 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.
    17. Hess, Stephane & Quddus, Mohammed & Rieser-Schüssler, Nadine & Daly, Andrew, 2015. "Developing advanced route choice models for heavy goods vehicles using GPS data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 29-44.
    18. Carlo Prato & Shlomo Bekhor & Cristina Pronello, 2012. "Latent variables and route choice behavior," Transportation, Springer, vol. 39(2), pages 299-319, March.
    19. 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).
    20. Mogens Fosgerau & Mads Paulsen & Thomas Kj{ae}r Rasmussen, 2021. "A perturbed utility route choice model," Papers 2103.13784, arXiv.org, revised Sep 2021.

    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:kap:transp:v:47:y:2020:i:1:d:10.1007_s11116-017-9849-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.