IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v267y2018i1p288-303.html
   My bibliography  Save this article

Itinerary planning with time budget for risk-averse travelers

Author

Listed:
  • Zhang, Yu
  • Tang, Jiafu

Abstract

Itinerary planning problem (IPP) in public transport networks has witnessed to be a fundamental and important problem in public transport operations management. Although empirical studies show that time budgets are usually prescribed by travelers, the time budget is rarely considered in literature related to IPP under stochastic travel times. In this paper, we study the IPP with time budget (IPPB) in public transport networks with stochastic travel times, which consists of planning an itinerary from an origin to a destination that helps risk-averse travelers mitigate uncertainty and effectively meet their time budgets. A mathematical model (MRHA-IPPB) is developed for the IPPB, in which we use the utility theory to characterize travelers’ risk-averse behaviors. Since minimizing the lateness probability or the expected lateness duration is intractable, we propose a new decision criterion, maximizing risk-hedging ability (short for MRHA hereafter) while guaranteeing that the corresponding certainty equivalent of itinerary travel time would not exceed the time budget. The model MRHA-IPPB is shown theoretically and numerically to consider both the lateness probability and the lateness duration. We show NP-completeness of the IPPB with fully correlated arc travel times and study two tractable scenarios, i.e., the IPPB with independent arc travel times and that with partially correlated arc travel times. We decompose an IPPB as a two-stage problem and efficiently solve it through a binary search scheme with a label-setting algorithm embedded. We demonstrate the effectiveness of the MRHA-IPPB model through an illustrative example and show that the MRHA-based decomposition approach requires only less than one second per query over a real-world public transport network.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:267:y:2018:i:1:p:288-303
    DOI: 10.1016/j.ejor.2017.11.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717310342
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2017.11.023?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. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
    2. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    3. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    4. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    5. Robert J. Aumann & Roberto Serrano, 2008. "An Economic Index of Riskiness," Journal of Political Economy, University of Chicago Press, vol. 116(5), pages 810-836, October.
    6. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    7. Lozano, Angélica & Storchi, Giovanni, 2002. "Shortest viable hyperpath in multimodal networks," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 853-874, December.
    8. 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.
    9. Androutsopoulos, Konstantinos N. & Zografos, Konstantinos G., 2009. "Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network," European Journal of Operational Research, Elsevier, vol. 192(1), pages 18-28, January.
    10. Hall, Randolph W., 1983. "Travel outcome and performance: The effect of uncertainty on accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 17(4), pages 275-290, August.
    11. A. Ahmadi-Javid, 2012. "Addendum to: Entropic Value-at-Risk: A New Coherent Risk Measure," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 1124-1128, December.
    12. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
    13. Horn, Mark E. T., 2003. "An extended model and procedural framework for planning multi-modal passenger journeys," Transportation Research Part B: Methodological, Elsevier, vol. 37(7), pages 641-660, August.
    14. Li, Baibing & Martin, Elaine B. & Morris, A. Julian, 2002. "On principal component analysis in L1," Computational Statistics & Data Analysis, Elsevier, vol. 40(3), pages 471-474, September.
    15. Joaquín de Cea & Enrique Fernández, 1993. "Transit Assignment for Congested Public Transport Systems: An Equilibrium Model," Transportation Science, INFORMS, vol. 27(2), pages 133-147, May.
    16. de Palma, André & Picard, Nathalie, 2005. "Route choice decision under travel time uncertainty," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(4), pages 295-324, May.
    17. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    18. Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
    19. Aharon Ben‐Tal & Marc Teboulle, 2007. "An Old‐New Concept Of Convex Risk Measures: The Optimized Certainty Equivalent," Mathematical Finance, Wiley Blackwell, vol. 17(3), pages 449-476, July.
    20. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    21. 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.
    22. Pitu Mirchandani & Hossein Soroush, 1987. "Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions," Transportation Science, INFORMS, vol. 21(3), pages 133-152, August.
    23. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    24. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    25. Lo, Hong K. & Luo, X.W. & Siu, Barbara W.Y., 2006. "Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 792-806, November.
    26. 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.
    27. Daganzo, Carlos F., 2009. "A headway-based approach to eliminate bus bunching: Systematic analysis and comparisons," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 913-921, December.
    28. S. Mahmassani, Hani & F. Hyland, Michael, 2016. "Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale applicationAuthor-Name: Verbas, Ömer," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 1-16.
    29. Peter R. Stopher & Asif Ahmed & Wen Liu, 2017. "Travel time budgets: new evidence from multi-year, multi-day data," Transportation, Springer, vol. 44(5), pages 1069-1082, September.
    30. H. Frank, 1969. "Shortest Paths in Probabilistic Graphs," Operations Research, INFORMS, vol. 17(4), pages 583-599, August.
    31. Asadi Bagloee, Saeed & Ceder, Avishai (Avi), 2011. "Transit-network design methodology for actual-size road networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1787-1804.
    32. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    33. Qi, Jin & Sim, Melvyn & Sun, Defeng & Yuan, Xiaoming, 2016. "Preferences for travel time under risk and ambiguity: Implications in path selection and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 264-284.
    34. A. Ahmadi-Javid, 2012. "Entropic Value-at-Risk: A New Coherent Risk Measure," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 1105-1123, December.
    35. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    36. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    37. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    38. Guihaire, Valérie & Hao, Jin-Kao, 2008. "Transit network design and scheduling: A global review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(10), pages 1251-1273, December.
    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. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    2. 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.
    3. Zhang, Yu & Wang, Yu & Tang, Jiafu & Lim, Andrew, 2020. "Mitigating overtime risk in tactical surgical scheduling," Omega, Elsevier, vol. 93(C).

    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. Zhang, Yu & Tang, Jiafu, 2018. "A robust optimization approach for itinerary planning with deadline," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 56-74.
    2. 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.
    3. Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
    4. 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.
    5. Zhang, Yuli & Max Shen, Zuo-Jun & Song, Shiji, 2017. "Lagrangian relaxation for the reliable shortest path problem with correlated link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 501-521.
    6. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
    7. 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.
    8. Tan, Zhijia & Yang, Hai & Guo, Renyong, 2014. "Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 16-31.
    9. 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.
    10. 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.
    11. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    12. Nie, Yu (Marco) & Wu, Xing & Dillenburg, John F. & Nelson, Peter C., 2012. "Reliable route guidance: A case study from Chicago," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(2), pages 403-419.
    13. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    14. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.
    15. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.
    16. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    17. Zhang, Yu & Wang, Yu & Tang, Jiafu & Lim, Andrew, 2020. "Mitigating overtime risk in tactical surgical scheduling," Omega, Elsevier, vol. 93(C).
    18. 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.
    19. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    20. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.

    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:eee:ejores:v:267:y:2018:i:1:p:288-303. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.