Advertisement

Data-driven planning of reliable itineraries in multi-modal transit networks

  • Michael RedmondEmail author
  • Ann Melissa Campbell
  • Jan Fabian Ehmke
Original Paper

Abstract

Multi-modal travel itineraries are based on traversing multiple legs using more than one mode of transportation. The more combinations of legs and modes, the more challenging it is for a traveler to identify a reliable itinerary. Transportation providers collect data that can increase transparency for reliable travel planning. However, this data has not been fully exploited yet, although it will likely form an important piece of future traveler information systems. Our paper takes an important step in this direction by analyzing and aggregating data from the operation of scheduled and unscheduled modes to create a reliability measure for multi-modal travel. We use a network search algorithm to evaluate itineraries that combine schedule-based long-distance travel with airlines with last-mile and first-mile drive times to efficiently identify the one with the highest reliability given a start time and travel-time budget. Our network search considers multiple origin and destination airports which impacts the first and last mile as well as the flight options. We use extensive historical datasets to create reliable itineraries and compare these with deterministic shortest travel-time itineraries. We investigate the amount of data that is required to create reliable multi-modal travel itineraries. Additionally, we highlight the benefits and costs of reliable travel itineraries and analyze their structure.

Keywords

Stochastic network search Travel reliability Multi-modal Schedule-based Travel time distributions 

Notes

References

  1. Andreas A, Smith JC, Küçükyavuz S (2007) Branch-and-price-and-cut algorithms for solving the reliable h-paths problem. J Glob Optim 42:443–466CrossRefGoogle Scholar
  2. Antsfeld L, Walsh T (2012) Finding optimal paths in multi-modal public transportation networks using hub nodes and TRANSIT algorithm. Artif Intell Logist 2012:7–11Google Scholar
  3. Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2016) Route planning in transportation networks, in algorithm engineering. Springer, Berlin, pp 19–80Google Scholar
  4. Böhmová K, Mihalák M, Pröger R Tobias, Srámek P Widmayer (2013) Robust routing in urban public transportation: how to find reliable journeys based on past observations. ATMOS 13:27–41Google Scholar
  5. Chai T, Draxler RR (2014) Root mean square error (RMSE) or mean absolute error (MAE)?—arguments against avoiding RMSE in literature. Geoscie Model Dev 7:1247–1250CrossRefGoogle Scholar
  6. Chen BY, Lam WH, Sumalee A, Li Q, Shao H, Fang Z (2013) Finding reliable shortest paths in road networks under uncertainty. Netw Spat Econ 13:123–148CrossRefGoogle Scholar
  7. Cheng J, Lisser A (2015) Maximum probability shortest path problem. Discret Appl Math 192:40–48CrossRefGoogle Scholar
  8. Delling D, Dibbelt J, Pajor T, Wagner D, Werneck R (2013) Computing multimodal journeys in practice. In: International symposium on experimental algorithms, pp 260–271CrossRefGoogle Scholar
  9. Devarasetty P, Burris M, Shaw W (2012) Do travelers pay for managed-lane travel as they claimed they would? Before-and-after study of travelers on Katy Freeway, Houston, Texas. Transp Res Board J Transp Res Board 2297:58–65Google Scholar
  10. Dibbelt J, Pajor T, Wagner D (2015) User-constrained multimodal route planning. J Exp Algorithmics 19:11–119CrossRefGoogle Scholar
  11. Duan Z, Sun S, Sun S, Li W (2015) Stochastic time-dependent vehicle routing problem: mathematical models and ant colony algorithm. Adv Mech Eng 7:1–16Google Scholar
  12. Ehmke J, Campbell A (2014) Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur J Oper Res 233:193–207CrossRefGoogle Scholar
  13. Ehreke I, Hess S, Weis C, Axhausen K (2015) Reliability in the German value of time study. Transp Res Rec J Transp Res Board 2495:14–22CrossRefGoogle Scholar
  14. Fleischmann B, Gietz M, Gnutzmann S (2004) Time-varying travel times in vehicle routing. Transp Sci 38:160–173CrossRefGoogle Scholar
  15. Gao S, Chabini I (2002) Best routing policy problem in stochastic time-dependent networks. Transp Res Rec 1783:188–196CrossRefGoogle Scholar
  16. GoogleMaps (2018). https://developers.google.com/maps/documentation/. Accessed 13 Dec 2018
  17. Guessous Y, Aron M, Bhouri N, Cohen S (2014) Estimating travel time distribution under different traffic conditions. Transp Res Proced 3:339–348CrossRefGoogle Scholar
  18. Hess S, Adler T, Polak JW (2007) Modelling airport and airline choice behaviour with the use of stated preference survey data. Transp Res Part E Logist Transp Rev 43:221–233CrossRefGoogle Scholar
  19. Hickman M (2002) Robust passenger itinerary planning using transit AVL data. In: Proceedings of the IEEE 5th international conference on intelligent transportation systems, IEEE, pp 840–845Google Scholar
  20. Hossan MS, Asgari H, Jin X (2016) Investigating prefernce heterogenieity in value of time (VOT) and value of reliability (VOR) estiamtion for managed lanes. Transp Res Part A Policy Pract 94:638–649CrossRefGoogle Scholar
  21. Jones R (2013) 1000 Largest US Cities by population with geographic coordinates. https://gist.github.com/Miserlou/c5cd8364bf9b2420bb29. Accessed 13 Dec 2018
  22. Keyhani MH, Schnee M, Weihe K, Zorn HP (2012) Reliability and delay distributions of train connections. In: OASIcs-OpenAccess series in informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol  25, pp 35–46Google Scholar
  23. Kou W, Chen X, Yu L, Qi Y, Wang Y (2017) Urban commuters’ valuation of travel time reliability based on stated preference survey: a case study of Beijing. Transp Res Part A Policy Pract 95:372–380CrossRefGoogle Scholar
  24. Liu Y, Blandin S, Samaranayake S (2019) Stochastic on-time arrival problem in transit networks. Transp Res Part B Methodol 119:122–138CrossRefGoogle Scholar
  25. Maan M (2018) Rome2Rio launches all-new app for iOS. https://www.rome2rio.com/blog/2018/06/12/new-rome2rio-app/. Accessed 13 Dec 2018
  26. McCoy K, Andrew J, Glynn R, Lyons W et al (2018) Integratingshared mobility into multimodal transportation planning: improving regional performance to meet public goals. Technical report, UnitedStates. Federal Highway Administration. Office of PlanningGoogle Scholar
  27. Miller-Hooks ED, Mahmassani HS (2000) Least expected time paths in stochastic, time-varying transportation networks. Transp Sci 34:198–215CrossRefGoogle Scholar
  28. Musulin K (2018) Coord unveils routing API to support multimodal trip planning. https://www.smartcitiesdive.com/news/coord-routing-api-multimodal-trip-planning/524525/. Accessed 13 Dec 2018
  29. Nie Y, Wu X (2009) Shortest path problem considering on-time arrival probability. Transp Res Part B 43:597–613CrossRefGoogle Scholar
  30. Niknami M, Samaranayake S (2016) Tractable pathfinding for the stochastic on-time arrival problem. In: International symposium on experimental algorithms. Springer, pp 231–245Google Scholar
  31. Redmond M, Campbell AM, Ehmke JF (2019) The most reliable flight itinerary problem. Networks 73:325–343Google Scholar
  32. Smirnov N (1948) Table for estimating the goodness of fit of empirical distributions. Ann Math Stat 19:279–281CrossRefGoogle Scholar
  33. Spero J (2019) Flight delays in Europe more than double. Financial TimesGoogle Scholar
  34. Tu Y, Ball M, Jank W (2008) Estimating flight departure delay distributions—a statistical approach with long-term trend and short-term pattern. J Am Stat Assoc 103:112–125CrossRefGoogle Scholar
  35. UberTechnologies (2018) https://movement.uber.com. Accessed 13 Dec 2018
  36. Ulloa L, Lehoux-Lebacque V, Roulland F (2017) Trip planning within a multimodal urban mobility. IET Intel Transp Syst 12:87–92CrossRefGoogle Scholar
  37. Wang L, Yang L, Gao Z (2016) The constrained shortest path problem with stochastic correlated link travel times. Eur J Oper Res 255:43–57CrossRefGoogle Scholar
  38. Wong Y, Hensher D, Mulley C (2017) Emerging transport technologies and the modal efficiency framework: a case for mobility as a service (MaaS). In: International conference on competition and ownership of land passenger transport, pp 13–17Google Scholar
  39. Zhang Y, Tang J (2018) A robust optimization approach for itinerary planning with deadline. Transp Res Part E Logist Transp Rev 113:56–74CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Business AnalyticsUniversity of IowaIowaUSA
  2. 2.Management Science GroupOtto-von-Guericke University MagdeburgMagdeburgGermany

Personalised recommendations