Dynamic and stochastic routing for multimodal transportation systems

Dynamic and stochastic routing for multimodal transportation systems

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Intelligent Transport Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors present a case study of a multimodal routing system that takes into account both dynamic and stochastic travel time information. A multimodal network model is presented that makes it possible to model the travel time information of each transportation mode differently. This travel time information can either be static or dynamic, or either deterministic or stochastic. Next, a Dijkstra-based routing algorithm is presented that deals with this variety of travel time information in a uniform way. This research focuses on a practical implementation of the system, which means that a number of assumptions were made, like the modelling of the stochastic distributions, comparing these distributions, and so on. A tradeoff had to be made between the performance of the system and the accuracy of the results. Experiments have shown that the proposed system produces realistic routes in a short amount of time. It is demonstrated that routing dynamically indeed results in a travel time gain in comparison to routing statically. By making use of the additional stochastic travel time information even better (i.e. faster), more reliable routes can be calculated. Moreover, it is shown that routing in the multimodal network may have its advantages over routing in a unimodal network, especially during rush hours.


    1. 1)
    2. 2)
    3. 3)
      • 3. Delling, D., Wagner, D.: ‘Time-dependent route planning’, in Ahuja, R., Mohring, R., Zaroliagis, C. (Eds.): ‘Robust and online large-scale optimization’ (Springer, Berlin–Heidelberg, 2009), pp. 207230.
    4. 4)
    5. 5)
      • 5. Kieritz, T., Luxen, D., Sanders, P., Vetter, C., Festa, P.: ‘Distributed time-dependent contraction hierarchies’, in Festa, P. (Ed.): ‘Experimental algorithms’, (Springer, Berlin–Heidelberg, 2010) LNCS, pp. 8393.
    6. 6)
    7. 7)
      • 7. Demiryurek, U., Banaei Kashani, F., Shahabi, C.: ‘A case for time-dependent shortest path computation in spatial networks’. Proc. 18th SIGSPATIAL Int. Conf. Advances in Geographic Information Systems (GIS 10), San Jose, California, 2010, pp. 474477.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
      • 13. Li, H., Bliemer, M.C.J., Bovie, P.H.L.: ‘Strategic departure time choice in a bottleneck with stochastic capacities’. TRB 87th Annual Meeting, Washington DC, January 2008.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • 17. Demeyer, S., Audenaert, P., Slock, B., Pickavet, P., Demeester, P.: ‘Multimodal transport planning in a dynamic environment’. Conf. Intelligent Public Transport Systems (IPTS), Amsterdam, April 2008, pp. 155167.
    18. 18)
      • 18. Van Nes, R.: ‘Design of multimodal transport networks: a hierarchical approach’. TRAIL Thesis Series T2002/5, 2002, DUP, Delft University, The Netherlands, 2002.
    19. 19)
      • 19. Ayed, H., Khadraoui, D., Habbas, Z., Bouvry, P., Merche, J.F.: ‘Transfer graph approach for multimodal transport problems’, in Le Thi, H.A., Bouvry, P., Pham Dinh, T. (Eds.): ‘Modelling, Computation and Optimization in Information Systems and Management Sciences’ (Springer, Berlin–Heidelberg, 2008), pp. 538547.
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
      • 24., accessed March 2012.
    25. 25)
      • 25., accessed March 2012.
    26. 26)
      • 26. Cormen, T.H., Leierson, C.E., Rivest, L.R., Stein, C.: ‘Introduction to algorithms: second edition’ (MIT Press, Cambridge, 2001).
    27. 27)
    28. 28)
      • 28. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: ‘Contraction hierarchies: faster and simpler hierarchical routing in road networks’. Seventh Workshop on Experimental Algorithms, May–June 2008, pp. 319333.
    29. 29)
      • 29. Bast, H., Carlsson, E., Eignwillig, A., et al: ‘Fast routing in very lage public transportation networks using transfer patterns’. Algorithms – ESA, 2020(LNCS, 6346), pp. 290301.
    30. 30)
      • 30. Batz, G.V., Delling, D., Sanders, P., Vetter, C.: ‘Time-dependent contraction hierarchies’. Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), January 2009, pp. 97105.

Related content

This is a required field
Please enter a valid email address