{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:53:14Z","timestamp":1762444394380},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_24","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"260-271","source":"Crossref","is-referenced-by-count":32,"title":["Computing Multimodal Journeys in Practice"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Barrett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering Label-Constrained Shortest-Path Algorithms. In: The Shortest Path Problem: 9th DIMACS Impl. Challenge. DIMACS, vol.\u00a074, pp. 309\u2013319. AMS (2009)","DOI":"10.1090\/dimacs\/074\/12"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03456-5_24","volume-title":"Efficient Algorithms","author":"H. Bast","year":"2009","unstructured":"Bast, H.: Car or Public Transport \u2013 Two Worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"24_CR3","unstructured":"Bast, H.: Next-Generation Route Planning: Multi-Modal, Real-Time, Personalized (2012) Talk given at ISMP"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-15775-2_25","volume-title":"Algorithms \u2013 ESA 2010","author":"H. Bast","year":"2010","unstructured":"Bast, H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., Viger, F.: Fast Routing in Very Large Public Transportation Networks using Transfer Patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 290\u2013301. Springer, Heidelberg (2010)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.20382","volume":"57","author":"R. Bauer","year":"2011","unstructured":"Bauer, R., Delling, D., Wagner, D.: Experimental Study on Speed-Up Techniques for Timetable Information Systems. Networks\u00a057(1), 38\u201352 (2011)","journal-title":"Networks"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1016\/j.ejor.2005.02.036","volume":"175","author":"M. Bielli","year":"2006","unstructured":"Bielli, M., Boulmakoul, A., Mouncif, H.: Object modeling and path computation for multimodal travel systems. EJOR\u00a0175(3), 1705\u20131730 (2006)","journal-title":"EJOR"},{"issue":"1","key":"24_CR7","first-page":"9","volume":"1","author":"D. Corne","year":"2003","unstructured":"Corne, D., Deb, K., Fleming, P., Knowles, J.: The Good of the Many Outweighs the Good of the One: Evolutionary Multi-Objective Optimization. Connections\u00a01(1), 9\u201313 (2003)","journal-title":"Connections"},{"key":"24_CR8","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Wagner, D., Werneck, R.F.: Computing and Evaluating Multimodal Journeys. Technical Report 2012-20, Faculty of Informatics, Karlsruhe Institute of Technology (2012)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable Route Planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-Based Public Transit Routing. In: ALENEX, pp. 130\u2013140. SIAM (2012)","DOI":"10.1137\/1.9781611972924.13"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Pajor, T., Wagner, D.: User-Constrained Multi-Modal Route Planning. In: ALENEX, pp. 118\u2013129. SIAM (2012)","DOI":"10.1137\/1.9781611972924.12"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller\u2013Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"24_CR15","unstructured":"Ensor, A., Lillo, F.: Partial order approach to compute shortest paths in multimodal networks. Technical report (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1112.3366v1"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TSMCA.2004.824873","volume":"34","author":"M. Farina","year":"2004","unstructured":"Farina, M., Amato, P.: A Fuzzy Definition of \u201cOptimality\u201d for Many-Criteria Optimization Problems. IEEE Tr. Syst., Man, and Cyb. A\u00a034(3), 315\u2013326 (2004)","journal-title":"IEEE Tr. Syst., Man, and Cyb. A"},{"issue":"3","key":"24_CR17","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.\u00a046(3), 388\u2013404 (2012)","journal-title":"Transp. Sci."},{"key":"24_CR18","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.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 67\u201390. Springer, Heidelberg (2007)"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S0377-2217(97)00376-7","volume":"111","author":"P. Modesti","year":"1998","unstructured":"Modesti, P., Sciomachen, A.: A Utility Measure for Finding Multiobjective Shortest Paths in Urban Multimodal Transportation Networks. EJOR\u00a0111(3), 495\u2013508 (1998)","journal-title":"EJOR"},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/2.53","volume":"21","author":"L.A. Zadeh","year":"1988","unstructured":"Zadeh, L.A.: Fuzzy Logic. IEEE Computer\u00a021(4), 83\u201393 (1988)","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:42:48Z","timestamp":1557704568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}