{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:37:07Z","timestamp":1753601827439},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,11,22]],"date-time":"2014-11-22T00:00:00Z","timestamp":1416614400000},"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":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00450-014-0287-3","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:32:17Z","timestamp":1417541537000},"page":"105-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Towards route planning algorithms for electric vehicles with realistic constraints"],"prefix":"10.1007","volume":"31","author":[{"given":"Moritz","family":"Baum","sequence":"first","affiliation":[]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Gemsa","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,22]]},"reference":[{"key":"287_CR1","doi-asserted-by":"crossref","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269\u2013271","DOI":"10.1007\/BF01386390"},{"key":"287_CR2","unstructured":"Bast H, Delling D, Goldberg AV, M\u00fcller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2014) Route planning in transportation networks. Technical Report MSR-TR-2014-4, Microsoft Research"},{"key":"287_CR3","doi-asserted-by":"crossref","unstructured":"Sachenbacher M, Leucker M, Artmeier A, Haselmayr J (2011) Efficient energy-optimal routing for electric vehicles. In: Proceedings of the 25th AAAI conference on artificial intelligence. AAAI Press, Palo Alto, California","DOI":"10.1609\/aaai.v25i1.7803"},{"key":"287_CR4","doi-asserted-by":"crossref","unstructured":"Eisner J, Funke S, Storandt S (2011) Optimal route planning for electric vehicles in large network. In: Proceeding of the 25th AAAI conference on artificial intelligence. AAAI Press, Palo Alto, California","DOI":"10.1609\/aaai.v25i1.7991"},{"key":"287_CR5","doi-asserted-by":"crossref","unstructured":"Baum M, Dibbelt J, Pajor T, Wagner D (2013) Energy-optimal routes for electric vehicles. In: Proceeding of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems. ACM Press, New York","DOI":"10.1145\/2525314.2525361"},{"key":"287_CR6","doi-asserted-by":"crossref","unstructured":"Storandt S, Funke S (2012) Cruising with a battery-powered vehicle and not getting stranded. In: Proceeding of the 26th AAAI conference on artificial intelligence. AAAI Press","DOI":"10.1609\/aaai.v26i1.8326"},{"key":"287_CR7","unstructured":"Baum M, Dibbelt J, H\u00fcbschle-Schneider L, Pajor T, Wagner D. Speed-consumption trade-off for electric vehicles. In: Proceeding of the 14th workshop on algorithmic approaches for transportation modeling, optimization, and systems. OASIcs"},{"key":"287_CR8","doi-asserted-by":"crossref","unstructured":"Storandt S (2012) Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceeding of the 5th ACM SIGSPATIAL international workshop on computational transportation science. ACM Press, New York","DOI":"10.1145\/2442942.2442947"},{"key":"287_CR9","volume-title":"Computers and intractability. A guide to the theory of N P-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of N P-completeness. W. H. Freeman and Company, New York"},{"key":"287_CR10","doi-asserted-by":"crossref","unstructured":"Hansen P (1979) Bricriteria path problems. In: Multiple criteria decision making\u2014theory and application. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"3","key":"287_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"26","author":"E Queiros Martins","year":"1984","unstructured":"Queiros Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 26(3):236\u2013245","journal-title":"Eur J Oper Res"},{"issue":"1","key":"287_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1):1\u201313","journal-title":"J ACM"},{"issue":"3","key":"287_CR13","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"G Robert","year":"2012","unstructured":"Robert G, Peter S, Dominik S, Christian V (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388\u2013404","journal-title":"Transp Sci"},{"key":"287_CR14","unstructured":"Geisberger R, Vetter C (2001) Effcient routing in road networks with turn costs. In: Proceeding of the 10th international symposium on experimental algorithms. Springer, New York"},{"key":"287_CR15","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Proceeding of the 10th international symposium on experimental algorithms. Springer, New York","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"287_CR16","unstructured":"Hausberger S (2003) Simulation of real world vehicle exhaust emissions. Mitteilungen des Institutes f\u00fcr Verbrennungskraftmaschinen und Thermodynamik, vol 82. Technische Universit\u00e4t Graz"},{"key":"287_CR17","unstructured":"Hausberger S, Rexeis M, Zallinger M, Luz R (2009) Emission factors from the model PHEM for the HBEFA version 3. Technical Report I-20\/2009, University of Technology, Graz"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-014-0287-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-014-0287-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-014-0287-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T11:28:25Z","timestamp":1690716505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-014-0287-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,22]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s00450-014-0287-3","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,22]]}}}