{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:32:21Z","timestamp":1778535141444,"version":"3.51.4"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319388502","type":"print"},{"value":"9783319388519","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_3","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"33-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Dynamic Time-Dependent Route Planning in Road Networks with User Preferences"],"prefix":"10.1007","author":[{"given":"Moritz","family":"Baum","sequence":"first","affiliation":[]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A.V., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route Planning in Transportation Networks. CoRR abs\/1504.05140 (2015)","DOI":"10.1007\/978-3-319-49487-6_2"},{"issue":"1.4","key":"3_CR2","first-page":"1","volume":"18","author":"GV Batz","year":"2013","unstructured":"Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics 18(1.4), 1\u201343 (2013)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-33090-2_16","volume-title":"Algorithms \u2013 ESA 2012","author":"GV Batz","year":"2012","unstructured":"Batz, G.V., Sanders, P.: Time-dependent route planning with generalized objective functions. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 169\u2013180. Springer, Heidelberg (2012)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-642-39206-1_9","volume-title":"Automata, Languages, and Programming","author":"R Bauer","year":"2013","unstructured":"Bauer, R., Columbus, T., Rutter, I., Wagner, D.: Search-space size in contraction hierarchies. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 93\u2013104. Springer, Heidelberg (2013)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Energy-optimal routes for electric vehicles. In: SIGSPATIAL 2013, pp. 54\u201363. ACM Press (2013)","DOI":"10.1145\/2525314.2525361"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K Cooke","year":"1966","unstructured":"Cooke, K., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"BC Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44(1), 41\u201346 (2004)","journal-title":"Networks"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-dependent SHARC-routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"key":"3_CR9","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transport. Sci. (2015)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: IPDPS 2011, pp. 1135\u20131146. IEEE Computer Society (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1287\/ijoc.1110.0448","volume":"24","author":"D Delling","year":"2012","unstructured":"Delling, D., Nannicini, G.: Core routing on dynamic time-dependent road networks. Informs J. Comput. 24(2), 187\u2013201 (2012)","journal-title":"Informs J. Comput."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: A case for time-dependent shortest path computation in spatial networks. In: SIGSPATIAL 2010, pp. 474\u2013477. ACM Press (2010)","DOI":"10.1145\/1869790.1869865"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Diamantopoulos, T., Kehagias, D., K\u00f6nig, F., Tzovaras, D.: Investigating the effect of global metrics in travel time forecasting. In: ITSC 2013, pp. 412\u2013417. IEEE (2013)","DOI":"10.1109\/ITSC.2013.6728266"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-319-07959-2_23","volume-title":"Experimental Algorithms","author":"J Dibbelt","year":"2014","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 271\u2013282. Springer, Heidelberg (2014)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1.5:1","DOI":"10.1145\/2886843","volume":"21","author":"J Dibbelt","year":"2016","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. J. Exp. Algorithmics. 21(1), 1.5:1\u20131.5:49 (2016). doi:\n                    10.1145\/2886843","journal-title":"J. Exp. Algorithmics."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"3_CR19","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":"3_CR20","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: Optimizing landmark-based routing and preprocessing. In: IWCTS 2013, pp. 25:25\u201325:30. ACM Press (2013)","DOI":"10.1145\/2533828.2533838"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-20086-6_23","volume-title":"Experimental Algorithms","author":"A Efentakis","year":"2015","unstructured":"Efentakis, A., Pfoser, D., Vassiliou, Y.: SALT. a unified framework for all shortest-path query variants on road networks. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 298\u2013311. Springer, Heidelberg (2015)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: SIGSPATIAL 2008, pp. 16:1\u201316:10. ACM Press (2008)","DOI":"10.1145\/1463434.1463455"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00453-012-9714-7","volume":"68","author":"L Foschini","year":"2014","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica 68(4), 1075\u20131097 (2014)","journal-title":"Algorithmica"},{"key":"3_CR24","unstructured":"Geisberger, R., Sanders, P.: Engineering time-dependent many-to-many shortest paths computation. In: ATMOS 2010, pp. 74\u201387. OASIcs (2010)"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388\u2013404 (2012)","journal-title":"Transp. Sci."},{"key":"3_CR26","unstructured":"Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX 2004, pp. 100\u2013111. SIAM (2004)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Hamann, M., Strasser, B.: Graph bisection with pareto-optimization. In: ALENEX 2016, pp. 90\u2013102. SIAM (2016)","DOI":"10.1137\/1.9781611974317.8"},{"issue":"2.5","key":"3_CR28","first-page":"1","volume":"13","author":"M Holzer","year":"2008","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multilevel overlay graphs for shortest-path queries. ACM J. Exp. Algorithmics 13(2.5), 1\u201326 (2008)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"3","key":"3_CR29","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. J. Inf. Process. 9(3), 159\u2013162 (1986)","journal-title":"J. Inf. Process."},{"issue":"5","key":"3_CR30","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S., Michalopoulos, G., Papastavrou, G., Paraskevopoulos, A., Wagner, D., Zaroliagis, C.: Analysis and experimental evaluation of time-dependent distance oracles. In: ALENEX 2015, pp. 147\u2013158. SIAM (2015)","DOI":"10.1137\/1.9781611973754.13"},{"key":"3_CR32","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: ALENEX 2016, pp. 1\u201314. SIAM (2016)","DOI":"10.1137\/1.9781611974317.1"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S., Wagner, D., Zaroliagis, C.: Hierarchical Oracles for Time-Dependent Networks. CoRR abs\/1502.05222 (2015)","DOI":"10.1137\/1.9781611974317.1"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/978-3-662-43948-7_59","volume-title":"Automata, Languages, and Programming","author":"S Kontogiannis","year":"2014","unstructured":"Kontogiannis, S., Zaroliagis, C.: Distance oracles for time-dependent networks. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 713\u2013725. Springer, Heidelberg (2014)"},{"issue":"4","key":"3_CR35","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1007\/s00453-015-0003-0","volume":"74","author":"S Kontogiannis","year":"2015","unstructured":"Kontogiannis, S., Zaroliagis, C.: Distance oracles for time-dependent networks. Algorithmica 74(4), 1404\u20131434 (2015)","journal-title":"Algorithmica"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Maervoet, J., Causmaecker, P.D., Berghe, G.V.: Fast approximation of reach hierarchies in networks. In: SIGSPATIAL 2014, pp. 441\u2013444. ACM Press (2014)","DOI":"10.1145\/2666310.2666474"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* search on time-dependent road networks. Networks 59, 240\u2013251 (2012)","journal-title":"Networks"},{"issue":"3","key":"3_CR38","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607\u2013625 (1990)","journal-title":"J. ACM"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Pfoser, D., Brakatsoulas, S., Brosch, P., Umlauft, M., Tryfona, N., Tsironis, G.: Dynamic travel time provision for road networks. In: SIGSPATIAL 2008, pp. 68:1\u201368:4. ACM Press (2008)","DOI":"10.1145\/1463434.1463513"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. In: ALENEX 2012, pp. 16\u201329. SIAM (2012)","DOI":"10.1137\/1.9781611972924.2"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-20086-6_22","volume-title":"Experimental Algorithms","author":"A Schild","year":"2015","unstructured":"Schild, A., Sommer, C.: On balanced separators in road networks. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 286\u2013297. Springer, Heidelberg (2015)"},{"issue":"4","key":"3_CR42","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<259::AID-NET6>3.0.CO;2-C","volume":"31","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Ozbay, K., Subramanian, S.: The time-dependent shortest pair of disjoint paths problem: complexity, models, and algorithms. Networks 31(4), 259\u2013272 (1998)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:48:03Z","timestamp":1558313283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}