{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:54:59Z","timestamp":1743083699279,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030197582"},{"type":"electronic","value":"9783030197599"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19759-9_10","type":"book-chapter","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:47:10Z","timestamp":1556351230000},"page":"152-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Cloud-Based Smart Mobility"],"prefix":"10.1007","author":[{"given":"Kalliopi","family":"Giannakopoulou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","volume-title":"Algorithm Engineering","author":"H Bast","year":"2016","unstructured":"Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19\u201380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-38851-9_3","volume-title":"Experimental Algorithms","author":"M Baum","year":"2016","unstructured":"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\u201349. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38851-9_3"},{"key":"10_CR3","unstructured":"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\u201361. Schloss Dagstuhl (2014)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jda.2017.09.001","volume":"46\u201347","author":"A Cionini","year":"2017","unstructured":"Cionini, A., et al.: Engineering graph-based models for dynamic timetable information systems. J. Discret. Algorithms 46\u201347, 40\u201358 (2017)","journal-title":"J. Discret. Algorithms"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-38527-8_24","volume-title":"Experimental Algorithms","author":"D Delling","year":"2013","unstructured":"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\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_24"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2015","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566\u2013591 (2015)","journal-title":"Transp. Sci."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-05465-5_7","volume-title":"Robust and Online Large-Scale Optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., Pajor, T., Wagner, D.: Engineering time-expanded graphs for faster timetable information. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 182\u2013206. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05465-5_7"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/trsc.2014.0534","volume":"49","author":"D Delling","year":"2015","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591\u2013604 (2015)","journal-title":"Transp. Sci."},{"key":"10_CR9","unstructured":"Dibbelt, J.: Engineering algorithms for route planning in multimodal transportation networks. Ph.D. thesis, Karlsruhe Institute of Technology, February 2016"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Gavalas, D., et al.: Renewable mobility in smart cities: cloud-based services. In: Proceedings of 23rd IEEE Symposium on Computers and Communications \u2013 ISCC 2018. IEEE Computer Society (2018, to appear)","DOI":"10.1109\/ISCC.2018.8538479"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-57045-7_4","volume-title":"Algorithmic Aspects of Cloud Computing","author":"K Giannakopoulou","year":"2017","unstructured":"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\u201364. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57045-7_4"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Giannakopoulou, K., Nikoletseas, S., Paraskevopoulos, A., Zaroliagis, C.: Dynamic timetable information in smart cities. In: Proceedings of 22nd IEEE Symposium on Computers and Communications \u2013 ISCC 2017, pp. 42\u201347. IEEE Computer Society (2017)","DOI":"10.1109\/ISCC.2017.8024502"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.: Multimodal dynamic journey planning. In: Proceedings of 23rd IEEE Symposium on Computers and Communications \u2013 ISCC 2018. IEEE Computer Society (2018, to appear)","DOI":"10.1109\/ISCC.2018.8538625"},{"key":"10_CR15","unstructured":"Goldberg, A., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156\u2013165. SIAM (2005)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S., Michalopoulos, G., Papastavrou, G., Paraskevopoulos, A., Wagner, D., Zaroliagis, C.: Engineering oracles for time-dependent road networks. In: Algorithm Engineering and Experiments \u2013 ALENEX 2016, pp. 1\u201314. SIAM (2016)","DOI":"10.1137\/1.9781611974317.1"},{"key":"10_CR17","unstructured":"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\u20134:17 (2017)"},{"key":"10_CR18","unstructured":"Kontogiannis, S., Wagner, D., Zaroliagis, C.: Hierarchical time-dependent oracles. In: Algorithms and Computation \u2013 ISAAC 2016. LIPIcs, vol. 64, pp. 47:1\u201347:13 (2016)"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1007\/s00453-015-0003-0","volume":"74","author":"S Kontogiannis","year":"2016","unstructured":"Kontogiannis, S., Zaroliagis, C.: Distance oracles for time-dependent networks. Algorithmica 74(4), 1404\u20131434 (2016)","journal-title":"Algorithmica"},{"key":"10_CR20","unstructured":"MOVESMART EU FP7 project. https:\/\/cordis.europa.eu\/project\/rcn\/110310_en.html"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-38233-8_26","volume-title":"Algorithms and Complexity","author":"G Mali","year":"2013","unstructured":"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\u2013323. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38233-8_26"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-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\u201390. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74247-0_3"},{"key":"10_CR23","unstructured":"OpenStreetMap Data Extracts. http:\/\/download.geofabrik.de"},{"issue":"2.4","key":"10_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1227161.1227166","volume":"12","author":"E Pyrga","year":"2008","unstructured":"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\u201339 (2008)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10_CR25","unstructured":"Reference CPU scores. http:\/\/i11www.iti.kit.edu\/~pajor\/survey"},{"key":"10_CR26","unstructured":"Transit Feeds. https:\/\/transitfeeds.com"},{"key":"10_CR27","unstructured":"Transport for London. https:\/\/tfl.gov.uk"},{"key":"10_CR28","unstructured":"Wagner, D., Z\u00fcndorf, T.: Public transit routing with unrestricted walking. In: Algorithmic Approaches for Transportation Modeling, Optimization, and Systems \u2013 ATMOS 2017. OASIcs, vol. 59, pp. 7:1\u20137:14 (2017)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19759-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T06:31:21Z","timestamp":1607409081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19759-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030197582","9783030197599"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19759-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}