IDEAS home Printed from https://ideas.repec.org/p/hhb/aarbls/2008-005.html
   My bibliography  Save this paper

Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks

Author

Listed:
  • Pretolani, Daniele

    (Department of Sciences and Methods of Engineering)

  • Nielsen, Lars Relund

    (Department of Genetics and Biotechnology)

  • Andersen, Kim Allan

    (Department of Business Studies, Aarhus School of Business)

  • Ehrgott, Matthias

    (Department of Engineering Science)

Abstract

We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' route choice and the more flexible "history-adaptive'' route choice. We point out some interesting properties of the sets of efficient solutions ("strategies'') found under the two models. We also suggest possible directions for improving computational techniques.

Suggested Citation

  • Pretolani, Daniele & Nielsen, Lars Relund & Andersen, Kim Allan & Ehrgott, Matthias, 2008. "Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks," CORAL Working Papers L-2008-05, University of Aarhus, Aarhus School of Business, Department of Business Studies.
  • Handle: RePEc:hhb:aarbls:2008-005
    as

    Download full text from publisher

    File URL: http://research.asb.dk/fbspretrieve/2878/L_2008_05.PDF
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    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. Kjeldsen, Karina Hjortshøj, 2008. "Classification of routing and scheduling problems in liner shipping," CORAL Working Papers L-2008-06, University of Aarhus, Aarhus School of Business, Department of Business Studies.

    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. D'Acierno, Luca & Cartenì, Armando & Montella, Bruno, 2009. "Estimation of urban traffic conditions using an Automatic Vehicle Location (AVL) System," European Journal of Operational Research, Elsevier, vol. 196(2), pages 719-736, July.
    2. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
    3. Pi, Xidong & Qian, Zhen (Sean), 2017. "A stochastic optimal control approach for real-time traffic routing considering demand uncertainties and travelers’ choice heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 710-732.
    4. Stephen Boyles & S. Waller, 2011. "Optimal Information Location for Adaptive Routing," Networks and Spatial Economics, Springer, vol. 11(2), pages 233-254, June.
    5. S. Waller & David Fajardo & Melissa Duell & Vinayak Dixit, 2013. "Linear Programming Formulation for Strategic Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 13(4), pages 427-443, December.
    6. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    7. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    8. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    9. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
    10. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
    11. Mohammad Nurul Hassan & Taha Hossein Rashidi & Neema Nassir, 2021. "Consideration of different travel strategies and choice set sizes in transit path choice modelling," Transportation, Springer, vol. 48(2), pages 723-746, April.
    12. Pramesh Kumar & Alireza Khani, 2021. "Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network," Networks and Spatial Economics, Springer, vol. 21(4), pages 771-800, December.
    13. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    14. Kucharski, Rafał & Gentile, Guido, 2019. "Simulation of rerouting phenomena in Dynamic Traffic Assignment with the Information Comply Model," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 414-441.
    15. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    16. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
    17. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
    18. Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
    19. 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.
    20. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.

    More about this item

    Keywords

    Multiple objective programming; shortest paths; stochastic;
    All these keywords.

    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:hhb:aarbls:2008-005. 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: Helle Vinbaek Stenholt (email available below). General contact details of provider: https://edirc.repec.org/data/ifhhadk.html .

    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.