Skip to main content
SpringerLink
Log in

Algorithms for Cloud-Based Smart Mobility

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11409))

Included in the following conference series:

Abstract

Innovative algorithm technology plays an important role in smart city applications. In this work, we review some recent innovative algorithmic approaches that contributed decisively in the development of efficient and effective cloud-based systems for smart mobility in urban environments.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

    It runs TDD [10], a straightforward time-dependent variant of Dijkstra’s algorithm, whose growing of search space (set of settled nodes) resembles the growing of a ball.

  2. 2.

    MCR-ht weakens the domination rules by trading off walking and arrival time. In MR-\(\infty \)-t10 the walking duration is not used as criterion and it is limited to 10 min.

References

  1. Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19–80. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49487-6_2

    Chapter  Google Scholar 

  2. Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Dynamic time-dependent route planning in road networks with user preferences. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 33–49. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-38851-9_3

    Chapter  Google Scholar 

  3. Cionini, A., et al.: Engineering graph-based models for dynamic timetable information systems. In: 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS2014). OASICS, vol. 42, pp. 46–61. Schloss Dagstuhl (2014)

    Google Scholar 

  4. Cionini, A., et al.: Engineering graph-based models for dynamic timetable information systems. J. Discret. Algorithms 46–47, 40–58 (2017)

    Article  MathSciNet  Google Scholar 

  5. Delling, D., Dibbelt, J., Pajor, T., Wagner, D., Werneck, R.F.: Computing multimodal journeys in practice. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 260–271. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38527-8_24

    Chapter  Google Scholar 

  6. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566–591 (2015)

    Article  Google Scholar 

  7. Delling, D., Pajor, T., Wagner, D.: Engineering time-expanded graphs for faster timetable information. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 182–206. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-05465-5_7

    Chapter  Google Scholar 

  8. Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591–604 (2015)

    Article  Google Scholar 

  9. Dibbelt, J.: Engineering algorithms for route planning in multimodal transportation networks. Ph.D. thesis, Karlsruhe Institute of Technology, February 2016

    Google Scholar 

  10. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395–412 (1969)

    Article  Google Scholar 

  11. Gavalas, D., et al.: Renewable mobility in smart cities: cloud-based services. In: Proceedings of 23rd IEEE Symposium on Computers and Communications – ISCC 2018. IEEE Computer Society (2018, to appear)

    Google Scholar 

  12. Giannakopoulou, K., Kontogiannis, S., Papastavrou, G., Zaroliagis, C.: A cloud-based time-dependent routing service. In: Sellis, T., Oikonomou, K. (eds.) ALGOCLOUD 2016. LNCS, vol. 10230, pp. 41–64. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57045-7_4

    Chapter  Google Scholar 

  13. Giannakopoulou, K., Nikoletseas, S., Paraskevopoulos, A., Zaroliagis, C.: Dynamic timetable information in smart cities. In: Proceedings of 22nd IEEE Symposium on Computers and Communications – ISCC 2017, pp. 42–47. IEEE Computer Society (2017)

    Google Scholar 

  14. Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.: Multimodal dynamic journey planning. In: Proceedings of 23rd IEEE Symposium on Computers and Communications – ISCC 2018. IEEE Computer Society (2018, to appear)

    Google Scholar 

  15. Goldberg, A., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156–165. SIAM (2005)

    Google Scholar 

  16. Kontogiannis, S., Michalopoulos, G., Papastavrou, G., Paraskevopoulos, A., Wagner, D., Zaroliagis, C.: Engineering oracles for time-dependent road networks. In: Algorithm Engineering and Experiments – ALENEX 2016, pp. 1–14. SIAM (2016)

    Google Scholar 

  17. Kontogiannis, S., Papastavrou, G., Paraskevopoulos, A., Wagner, D., Zaroliagis, C.: Improved oracles for time-dependent road networks. In: Algorithmic Approaches for Transportation Modeling, Optimization, and Systems - ATMOS 2017. OASIcs, vol. 59, pp. 4:1–4:17 (2017)

    Google Scholar 

  18. Kontogiannis, S., Wagner, D., Zaroliagis, C.: Hierarchical time-dependent oracles. In: Algorithms and Computation – ISAAC 2016. LIPIcs, vol. 64, pp. 47:1–47:13 (2016)

    Google Scholar 

  19. Kontogiannis, S., Zaroliagis, C.: Distance oracles for time-dependent networks. Algorithmica 74(4), 1404–1434 (2016)

    Article  MathSciNet  Google Scholar 

  20. MOVESMART EU FP7 project. https://cordis.europa.eu/project/rcn/110310_en.html

  21. Mali, G., Michail, P., Paraskevopoulos, A., Zaroliagis, C.: A new dynamic graph structure for large-scale transportation networks. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 312–323. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38233-8_26

    Chapter  Google Scholar 

  22. Müller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable information: models and algorithms. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Algorithmic Methods for Railway Optimization. LNCS, vol. 4359, pp. 67–90. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74247-0_3

    Chapter  Google Scholar 

  23. OpenStreetMap Data Extracts. http://download.geofabrik.de

  24. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12(2.4), 1–39 (2008)

    MathSciNet  MATH  Google Scholar 

  25. Reference CPU scores. http://i11www.iti.kit.edu/~pajor/survey

  26. Transit Feeds. https://transitfeeds.com

  27. Transport for London. https://tfl.gov.uk

  28. Wagner, D., Zündorf, T.: Public transit routing with unrestricted walking. In: Algorithmic Approaches for Transportation Modeling, Optimization, and Systems – ATMOS 2017. OASIcs, vol. 59, pp. 7:1–7:14 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Informatics, University of Patras, 26504, Patras, Greece

    Kalliopi Giannakopoulou

  2. Computer Technology Institute and Press “Diophantus”, 26504, Patras, Greece

    Kalliopi Giannakopoulou

Authors
  1. Kalliopi Giannakopoulou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kalliopi Giannakopoulou .

Editor information

Editors and Affiliations

  1. Technical University of Darmstadt, Darmstadt, Germany

    Yann Disser

  2. Hellenic Open University, Patras, Greece

    Vassilios S. Verykios

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Giannakopoulou, K. (2019). Algorithms for Cloud-Based Smart Mobility. In: Disser, Y., Verykios, V. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2018. Lecture Notes in Computer Science(), vol 11409. Springer, Cham. https://doi.org/10.1007/978-3-030-19759-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19759-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19758-2

  • Online ISBN: 978-3-030-19759-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation