Skip to main content
SpringerLink
Log in

Alternative Paths Reordering Using Probabilistic Time-Dependent Routing

  • Conference paper
  • First Online:
Advances in Networked-based Information Systems (NBiS - 2019 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1036))

Included in the following conference series:

Abstract

In this paper we propose an innovative routing algorithm which takes into account stochastic properties of the road segments using the Probabilistic Time-Dependent Routing (PTDR). It can provide optimal routes for vehicles driving in a smart city based on a global view of the road network. We have implemented the algorithm in a distributed on-line service which can leverage heterogeneous resources such as Cloud or High Performance Computing (HPC) in order to serve a large number of clients simultaneously and efficiently. A preliminary experimental results using a custom traffic simulator are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    PTDR Source code - https://github.com/It4innovations/PTDR.

  2. 2.

    Data computed by a routing algorithm.

  3. 3.

    https://youtu.be/OBXgGI7w_EA.

References

  1. Bader, R., Dees, J., Geisberger, R., Sanders, P.: Alternative route graphs in road networks. In: International Conference on Theory and Practice of Algorithms in (Computer) Systems, pp. 21–32. Springer (2011)

    Google Scholar 

  2. Blumer, S., Eichelberger, M., Wattenhofer, R.: Efficient traffic routing with progress guarantees. In: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 953–957 (2018). https://doi.org/10.1109/ICTAI.2018.00147

  3. Golasowski, M., Tomis, R., Martinovič, J., Slaninová, K., Rapant, L.: Performance evaluation of probabilistic time-dependent travel time computation. In: IFIP International Conference on Computer Information Systems and Industrial Management, pp. 377–388. Springer, Cham (2016)

    Chapter  Google Scholar 

  4. Martinovič, J., Snášel, V., Dvorskỳ, J., Dráždilová, P.: Search in documents based on topical development. In: Advances in Intelligent Web Mastering-2, pp. 155–166. Springer (2010)

    Google Scholar 

  5. Martinovič, J., Golasowski, M., Slaninová, K., Beránek, J., Šurkovský, M., Rapant, L., Szturcová, D., Cmar, R.: A distributed environment for traffic navigation systems. In: The 13th International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS 2019 (2019, accepted)

    Google Scholar 

  6. Miller-Hooks, E., Mahmassani, H.: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. Eur. J. Oper. Res. 146(1), 67–82 (2003)

    Article  MathSciNet  Google Scholar 

  7. Mouhcine, E., Mansouri, K., Mohamed, Y.: Intelligent Vehicle Routing System Using VANET Strategy Combined with a Distributed Ant Colony Optimization: Methods and Protocols, pp. 230–237 (2019)

    Chapter  Google Scholar 

  8. Nie, Y.M., Wu, X.: Shortest path problem considering on-time arrival probability. Transp. Res. Part B Methodol. 43(6), 597–613 (2009)

    Article  Google Scholar 

  9. Nikolova, E., Kelner, J., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. Algorithms-ESA 2006, 552–563 (2006)

    MathSciNet  MATH  Google Scholar 

  10. Ptošek, V., Ševčík, J., Martinovič, J., Slaninová, K., Rapant, L., Cmar, R.: Real time traffic simulator for self-adaptive navigation system validation (2018)

    Google Scholar 

  11. Rapant, L., Golasowski, M., Martinovič, J., Slaninová, K.: Simulated probabilistic speed profiles for selected routes in Prague (2018). https://doi.org/10.5281/zenodo.2275647

  12. Silvano, C., Agosta, G., Bartolini, A., Beccari, A.R., Benini, L., Besnard, L., Bispo, J., Cmar, R., Cardoso, J.M., Cavazzoni, C., et al.: Antarex: a dsl-based approach to adaptively optimizing and enforcing extra-functional properties in high performance computing. In: 2018 21st Euromicro Conference on Digital System Design (DSD), pp. 600–607. IEEE (2018)

    Google Scholar 

  13. Tomis, R., Rapant, L., Martinovič, J., Slaninová, K., Vondrák, I.: Probabilistic time-dependent travel time computation using Monte Carlo simulation. In: Kozubek, T., Blaheta, R., Šístek, J., Rozložník, M., Čermák, M. (eds.) High Performance Computing in Science and Engineering, pp. 161–170. Springer, Cham (2016)

    Google Scholar 

Download references

Acknowledgements

This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPS II) project ‘IT4Innovations excellence in science - LQ1602’, by the IT4Innovations infrastructure which is supported from the Large Infrastructures for Research, Experimental Development and Innovations project ‘IT4Innovations National Supercomputing Center – LM2015070’, and partially by the SGC grant No. SP2019/108 ‘Extension of HPC platforms for executing scientific pipelines’, VŠB - Technical University of Ostrava, Czech Republic.

Author information

Authors and Affiliations

  1. IT4Innovations, VSB - Technical University of Ostrava, 17. listopadu 2172/15, 708 00, Ostrava-Poruba, Czech Republic

    Martin Golasowski, Jakub Beránek, Martin Šurkovský, Lukáš Rapant, Daniela Szturcová, Jan Martinovič & Kateřina Slaninová

Authors
  1. Martin Golasowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Beránek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Šurkovský
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lukáš Rapant
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Daniela Szturcová
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jan Martinovič
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Kateřina Slaninová
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Golasowski .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Faculty of Information Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Division of Computer Science and Intelligent Systems, Faculty of Science and Technology, Oita University, Oita, Japan

    Hiroaki Nishino

  3. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

  4. Department of Advanced Sciences, Faculty of Science and Engineering, Hosei University, Tokyo, Japan

    Makoto Takizawa

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Golasowski, M. et al. (2020). Alternative Paths Reordering Using Probabilistic Time-Dependent Routing. In: Barolli, L., Nishino, H., Enokido, T., Takizawa, M. (eds) Advances in Networked-based Information Systems. NBiS - 2019 2019. Advances in Intelligent Systems and Computing, vol 1036. Springer, Cham. https://doi.org/10.1007/978-3-030-29029-0_22

Download citation

Publish with us

Policies and ethics

Search

Navigation