{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:32:18Z","timestamp":1778535138658,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330896","type":"print"},{"value":"9783642330902","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_16","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"169-180","source":"Crossref","is-referenced-by-count":11,"title":["Time-Dependent Route Planning with Generalized Objective Functions"],"prefix":"10.1007","author":[{"given":"Gernot Veit","family":"Batz","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","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.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97\u2013105. SIAM (April 2009)","DOI":"10.1137\/1.9781611972894.10"},{"issue":"1","key":"16_CR3","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\u00a060(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: [21], pp. 166\u2013177","DOI":"10.1007\/978-3-642-13193-6_15"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Brunel, E., Delling, D., Gemsa, A., Wagner, D.: Space-Efficient SHARC-Routing. In: [21], pp. 47\u201358","DOI":"10.1007\/978-3-642-13193-6_5"},{"key":"16_CR6","unstructured":"Vetter, C.: Parallel Time-Dependent Contraction Hierarchies. Student Research Project (2009), \n                  \n                    http:\/\/algo2.iti.kit.edu\/download\/vetter_sa.pdf"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An Appraisal of Some Shortest-Path Algorithms. Operations Research\u00a017(3), 395\u2013412 (1969)","journal-title":"Operations Research"},{"issue":"3","key":"16_CR8","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. Journal of the ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"Journal of the ACM"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A. Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum Weight Paths in Time-Dependent Networks. Networks\u00a021, 295\u2013319 (1991)","journal-title":"Networks"},{"key":"16_CR10","unstructured":"Dean, B.C.: Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Technical report, Massachusetts Institute of Technology (1999)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed Time-Dependent Contraction Hierarchies. In: [21], pp. 83\u201393","DOI":"10.1007\/978-3-642-13193-6_8"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Kobitzsch, M., Sanders, P.: Route Planning with Flexible Objective Functions. In: Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX 2010), pp. 124\u2013137. SIAM (2010)","DOI":"10.1137\/1.9781611972900.12"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/net.10072","volume":"41","author":"R.K. Ahuja","year":"2003","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutell\u00e0, M.G.: Dynamic Shortest Paths Minimizing Travel Times and Costs. Networks\u00a041(4), 197\u2013205 (2003)","journal-title":"Networks"},{"key":"16_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of \n                  \n                    \n                  \n                  $\\mathcal{NP}$\n                -Completeness. W.H.\u00a0Freeman and Company (1979)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the Complexity of Time-Dependent Shortest Paths. In: Proceedings of the 22nd Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 327\u2013341. SIAM (2011)","DOI":"10.1137\/1.9781611973082.27"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making\u2013Theory and Application, pp. 109\u2013127. Springer (1979)","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L. Mandow","year":"2010","unstructured":"Mandow, L., P\u00e9rez-de-la-Cruz, J.L.: Multiobjective A* Search with Consistent Heuristics. Journal of the ACM\u00a057(5), 27:1\u201327:24 (2010)","journal-title":"Journal of the ACM"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science (2012) (accepted for publication)","DOI":"10.1287\/trsc.1110.0401"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"16_CR21","series-title":"LNCS","volume-title":"Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010)","year":"2010","unstructured":"Festa, P. (ed.): SEA 2010. LNCS, vol.\u00a06049. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:45Z","timestamp":1620129285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}