{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:04Z","timestamp":1725798664951},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319111667"},{"type":"electronic","value":"9783319111674"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11167-4_3","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T06:28:52Z","timestamp":1407738532000},"page":"21-30","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Profile Routing for Electric Vehicles"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"Sch\u00f6nfelder","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Walther","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. Tech. rep., Microsoft Research (2014)"},{"key":"3_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 (2009)","DOI":"10.1137\/1.9781611972894.10"},{"key":"3_CR3","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":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","unstructured":"Eisner, J., Funke, S., Storandt, S.: Optimal route planning for electric vehicles in large networks. In: Twenty-Fifth AAAI Conference on Artificial Intelligence, vol.\u00a025, pp. 1108\u20131113 (2011)","DOI":"10.1609\/aaai.v25i1.7991"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Kobitzsch, M., Sanders, P.: Route planning with flexible objective functions. In: ALENEX, pp. 124\u2013137. SIAM (2010)","DOI":"10.1137\/1.9781611972900.12"},{"key":"3_CR7","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":"3_CR8","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165. Society for Industrial and Applied Mathematics (2005)"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"3_CR10","unstructured":"Masuch, N., L\u00fctzenberger, M., Keiser, J.: An Open Extensible Platform for Intermodal Mobility Assistance. Procedia Computer Science 19, 396\u2013403 (2013), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050913006625 , the 4th International Conference on Ambient Systems, Networks and Technologies (ANT 2013), the 3rd International Conference on Sustainable Energy Information Technology, SEIT 2013"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energyoptimal routing for electric vehicles. In: AAAI Publications, Twenty-Fifth AAAI Conference on Artificial Intelligence, vol.\u00a025, pp. 1402\u20131407 (2011)","DOI":"10.1609\/aaai.v25i1.7803"},{"key":"3_CR12","unstructured":"Sch\u00f6nfelder, R., Leucker, M.: Stochastisches Routen f\u00fcr Elektrofahrzeuge. Energieinformatik (2011)"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"A. Skriver","year":"2000","unstructured":"Skriver, A., Andersen, K.: A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research\u00a027(6), 507\u2013524 (2000), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054899000374","journal-title":"Computers & Operations Research"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Uludag, S., Uludag, Z., Nahrstedt, K., Lui, K.S., Baker, F.: A laplace transformbased method to stochastic path finding. In: IEEE International Conference on Communications, ICC 2009, pp. 1\u20135 (2009)","DOI":"10.1109\/ICC.2009.5198619"}],"container-title":["Lecture Notes in Computer Science","Internet of Vehicles \u2013 Technologies and Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11167-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T21:14:29Z","timestamp":1689455669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11167-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111667","9783319111674"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11167-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}