{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:06:15Z","timestamp":1780671975243,"version":"3.54.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WA 654\/23-1"],"award-info":[{"award-number":["WA 654\/23-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00453-019-00655-9","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T04:03:06Z","timestamp":1575345786000},"page":"1490-1546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Energy-Optimal Routes for Battery Electric Vehicles"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0898-7244","authenticated-orcid":false,"given":"Moritz","family":"Baum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Dibbelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonas","family":"Sauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Z\u00fcndorf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"655_CR1","doi-asserted-by":"crossref","unstructured":"Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: optimal routing for electric vehicles. In: Proceedings of the 33rd Annual German Conference on Advances in Artificial Intelligence (KI\u201910), Lecture Notes in Computer Science, vol. 6359, pp. 309\u2013316. Springer (2010)","DOI":"10.1007\/978-3-642-16111-7_35"},{"issue":"12","key":"655_CR2","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","author":"MJ Atallah","year":"1985","unstructured":"Atallah, M.J.: Some dynamic computational geometry problems. Comput. Math. Appl. 11(12), 1171\u20131181 (1985)","journal-title":"Comput. Math. Appl."},{"key":"655_CR3","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, Lecture Notes in Computer Science, vol. 9220, pp. 19\u201380. Springer (2016)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"655_CR4","first-page":"1.4: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\u20131.4:43 (2013)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"655_CR5","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Sanders, P.: Time-dependent route planning with generalized objective functions. In: Proceedings of the 20th Annual European Symposium on Algorithms (ESA\u201912), Lecture Notes in Computer Science, vol. 7501, pp. 169\u2013180. Springer (2012)","DOI":"10.1007\/978-3-642-33090-2_16"},{"key":"655_CR6","doi-asserted-by":"crossref","first-page":"2.3:1","DOI":"10.1145\/1671970.1671976","volume":"15","author":"R Bauer","year":"2010","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra\u2019s algorithm. ACM J. Exp. Algorithmics 15, 2.3:1\u20132.3:31 (2010)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"655_CR7","unstructured":"Baum, M.: Engineering Route Planning Algorithms for Battery Electric Vehicles. Phd thesis, Karlsruhe Institute of Technology (2018)"},{"key":"655_CR8","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Z\u00fcndorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. In: Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS\u201915), pp. 44:1\u201344:10. ACM (2015)","DOI":"10.1145\/2820783.2820826"},{"key":"655_CR9","unstructured":"Baum, M., Dibbelt, J., H\u00fcbschle-Schneider, L., Pajor, T., Wagner, D.: Speed-consumption tradeoff for electric vehicle route planning. In: Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201914), OpenAccess Series in Informatics (OASIcs), vol. 42, pp. 138\u2013151. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"655_CR10","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Energy-optimal routes for electric vehicles. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS\u201913), pp. 54\u201363. ACM (2013)","DOI":"10.1145\/2525314.2525361"},{"key":"655_CR11","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Dynamic time-dependent route planning in road networks with user preferences. In: Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916), Lecture Notes in Computer Science, vol. 9685, pp. 33\u201349. Springer (2016)","DOI":"10.1007\/978-3-319-38851-9_3"},{"key":"655_CR12","unstructured":"Baum, M., Dibbelt, J., Wagner, D., Z\u00fcndorf, T.: Modeling and engineering constrained shortest path algorithms for battery electric vehicles. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA\u201917), Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 11:1\u201311:16. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"655_CR13","unstructured":"Baum, M., Sauer, J., Wagner, D., Z\u00fcndorf, T.: Consumption profiles in route planning for electric vehicles: theory and applications. In: Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917), Leibniz International Proceedings in Informatics (LIPIcs), vol. 75, pp. 19:1\u201319:18. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"1","key":"655_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q Appl. Math."},{"key":"655_CR15","first-page":"2.7:1","volume":"14","author":"BV Cherkassky","year":"2010","unstructured":"Cherkassky, B.V., Georgiadis, L., Goldberg, A.V., Tarjan, R.E., Werneck, R.F.: Shortest-path feasibility algorithms: an experimental evaluation. ACM J. Exp. Algorithmics 14, 2.7:1\u20132.7:37 (2010)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"655_CR16","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"3","key":"655_CR17","doi-asserted-by":"publisher","first-page":"684","DOI":"10.2307\/2373068","volume":"87","author":"H Davenport","year":"1965","unstructured":"Davenport, H., Schinzel, A.: A combinatorial problem connected with differential equations. Am. J. Math. 87(3), 684\u2013694 (1965)","journal-title":"Am. J. Math."},{"key":"655_CR18","unstructured":"Dean, B.C.: Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Technical Report, Massachusetts Institute of Technology (2004)"},{"issue":"1","key":"655_CR19","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"},{"issue":"2","key":"655_CR20","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2017","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566\u2013591 (2017)","journal-title":"Transp. Sci."},{"key":"655_CR21","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201911), pp. 1135\u20131146. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"655_CR22","doi-asserted-by":"crossref","unstructured":"Delling, D., Holzer, M., M\u00fcller, K., Schulz, F., Wagner, D.: High-performance multi-level routing, dimacs series. In: Discrete Mathematics and Theoretical Computer Science, vol. 74, pp. 73\u201392. American Mathematical Society (2009)","DOI":"10.1090\/dimacs\/074\/04"},{"key":"655_CR23","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Proceedings of the 6th Workshop on Experimental Algorithms (WEA\u201907), Lecture Notes in Computer Science, vol. 4525, pp. 52\u201365. Springer (2007)","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"655_CR24","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Time-Dependent Route Planning, Lecture Notes in Computer Science, vol. 5868, pp. 207\u2013230. Springer (2009)","DOI":"10.1007\/978-3-642-05465-5_8"},{"key":"655_CR25","doi-asserted-by":"crossref","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. ACM J. Exp. Algorithmics 21, 1.5:1\u20131.5:49 (2016)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1","key":"655_CR26","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":"655_CR27","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":"655_CR28","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: Optimizing landmark-based routing and preprocessing. In: Proceedings of the 6th ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS\u201913), pp. 25\u201330. ACM (2013)","DOI":"10.1145\/2533828.2533838"},{"key":"655_CR29","doi-asserted-by":"crossref","unstructured":"Eisner, J., Funke, S., Storandt, S.: Optimal route planning for electric vehicles in large networks. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI\u201911), pp. 1108\u20131113. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7991"},{"key":"655_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.apenergy.2016.01.097","volume":"168","author":"C Fiori","year":"2016","unstructured":"Fiori, C., Ahn, K., Rakha, H.A.: Power-based electric vehicle energy consumption model: model development and validation. Appl. Energy 168, 257\u2013268 (2016)","journal-title":"Appl. Energy"},{"key":"655_CR31","unstructured":"Ford, L.R.: Network Flow Theory. Technical Report P-923, Rand Corporation, Santa Monica, California (1956)"},{"issue":"4","key":"655_CR32","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"},{"issue":"3","key":"655_CR33","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":"655_CR34","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a* search meets graph theory. In: Proceedings of the 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA\u201905), pp. 156\u2013165. SIAM (2005)"},{"key":"655_CR35","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Pszona, P.: Two-phase bicriterion search for finding fast and efficient electric vehicle routes. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS\u201914), pp. 193\u2013202. ACM (2014)","DOI":"10.1145\/2666310.2666382"},{"key":"655_CR36","unstructured":"Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings of the 6th Workshop on Algorithm Engineering & Experiments (ALENEX\u201904), pp. 100\u2013111. SIAM (2004)"},{"issue":"2","key":"655_CR37","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"655_CR38","unstructured":"Hausberger, S., Rexeis, M., Zallinger, M., Luz, R.: Emission Factors from the Model PHEM for the HBEFA Version 3. Technical Report I-20\/2009, University of Technology, Graz (2009)"},{"key":"655_CR39","doi-asserted-by":"crossref","first-page":"2.5:1","DOI":"10.1145\/1412228.1412239","volume":"13","author":"M Holzer","year":"2009","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multilevel overlay graphs for shortest-path queries. ACM J. Exp. Algorithmics 13, 2.5:1\u20132.5:26 (2009)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"655_CR40","doi-asserted-by":"publisher","first-page":"45","DOI":"10.3141\/2497-05","volume":"2497","author":"G Huber","year":"2015","unstructured":"Huber, G., Bogenberger, K.: Long-trip optimization of charging strategies for battery electric vehicles. Transp. Res. Record: J. Transp. Res. Board 2497, 45\u201353 (2015)","journal-title":"Transp. Res. Record: J. Transp. Res. Board"},{"issue":"3","key":"655_CR41","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/321765.321768","volume":"20","author":"DB Johnson","year":"1973","unstructured":"Johnson, D.B.: A note on Dijkstra\u2019s shortest path algorithm. J. ACM 20(3), 385\u2013388 (1973)","journal-title":"J. ACM"},{"issue":"1","key":"655_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1\u201313 (1977)","journal-title":"J. ACM"},{"issue":"5","key":"655_CR43","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":"655_CR44","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.trc.2013.07.001","volume":"36","author":"S Kluge","year":"2013","unstructured":"Kluge, S., S\u00e1nta, C., Dangl, S., Wild, S.M., Brokate, M., Reif, K., Busch, F.: On the computation of the energy-optimal route dependent on the traffic load in Ingolstadt. Transp. Res. Part C: Emerg. Technol. 36, 97\u2013115 (2013)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"655_CR45","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kiyama, N., Aoshima, H., Kashiyama, M.: A Route search method for electric vehicles in consideration of range and locations of charging stations. In: Proceedings of the 7th IEEE Intelligent Vehicles Symposium (IV\u201911), pp. 920\u2013925. IEEE (2011)","DOI":"10.1109\/IVS.2011.5940556"},{"key":"655_CR46","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.trb.2016.02.002","volume":"86","author":"CS Liao","year":"2016","unstructured":"Liao, C.S., Lu, S.H., Shen, Z.J.M.: The electric vehicle touring problem. Transp. Res. Part B: Methodol. 86, 163\u2013180 (2016)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"655_CR47","doi-asserted-by":"crossref","unstructured":"Liu, C., Wu, J., Long, C.: Joint charging and routing optimization for electric vehicle navigation systems. In: Proceedings of the 19th International Federation of Automatic Control World Congress (IFAC\u201914), IFAC Proceedings Volumes, vol. 47, pp. 9611\u20139616. Elsevier (2014)","DOI":"10.3182\/20140824-6-ZA-1003.01532"},{"key":"655_CR48","doi-asserted-by":"crossref","unstructured":"Luxen, D., Vetter, C.: Real-time routing with OpenStreetMap data. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS\u201911), pp. 513\u2013516. ACM (2011)","DOI":"10.1145\/2093973.2094062"},{"issue":"2","key":"655_CR49","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"655_CR50","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 21(3), 295\u2013319 (1991)","journal-title":"Networks"},{"key":"655_CR51","doi-asserted-by":"crossref","unstructured":"Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energy-optimal routing for electric vehicles. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI\u201911), pp. 1402\u20131407. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7803"},{"key":"655_CR52","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Proceedings of the 13th Annual European Conference on Algorithms (ESA\u201905), Lecture Notes in Computer Science, vol. 3669, pp. 568\u2013579. Springer (2005)","DOI":"10.1007\/11561071_51"},{"key":"655_CR53","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. In: Proceedings of the 14th Meeting on Algorithm Engineering & Experiments (ALENEX\u201912), pp. 16\u201329. SIAM (2012)","DOI":"10.1137\/1.9781611972924.2"},{"key":"655_CR54","unstructured":"Sch\u00f6nfelder, R., Leucker, M.: Abstract routing models and abstractions in the context of vehicle routing. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI\u201915), pp. 2639\u20132645. AAAI Press (2015)"},{"key":"655_CR55","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nfelder, R., Leucker, M., Walther, S.: Efficient profile routing for electric vehicles. In: Proceedings of the 1st International Conference on Internet of Vehicles (IOV\u201914), Lecture Notes in Computer Science, vol. 8662, pp. 21\u201330. Springer (2014)","DOI":"10.1007\/978-3-319-11167-4_3"},{"key":"655_CR56","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/351827.384254","volume":"5","author":"F Schulz","year":"2000","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s algorithm on-line: an empirical case study from public railroad transport. ACM J. Exp. Algorithmics 5, 12:1\u201312:23 (2000)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"655_CR57","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.: Using multi-level graphs for timetable information in railway systems. In: Proceedings of the 4th Workshop on Algorithm Engineering & Experiments (ALENEX\u201902), Lecture Notes in Computer Science, vol. 2409, pp. 43\u201359. Springer (2002)","DOI":"10.1007\/3-540-45643-0_4"},{"issue":"5","key":"655_CR58","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.cor.2011.07.017","volume":"39","author":"OJ Smith","year":"2012","unstructured":"Smith, O.J., Boland, N., Waterer, H.: Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39(5), 964\u2013984 (2012)","journal-title":"Comput. Oper. Res."},{"key":"655_CR59","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS\u201912), pp. 20\u201325. ACM (2012)","DOI":"10.1145\/2442942.2442947"},{"key":"655_CR60","unstructured":"Storandt, S.: Algorithms for Vehicle Navigation. Ph.D. thesis, Universit\u00e4t Stuttgart (2013)"},{"key":"655_CR61","doi-asserted-by":"crossref","unstructured":"Storandt, S., Funke, S.: Cruising with a battery-powered vehicle and not getting stranded. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI\u201912), pp. 1628\u20131634. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8326"},{"key":"655_CR62","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.trb.2017.03.007","volume":"103","author":"M Strehler","year":"2017","unstructured":"Strehler, M., Merting, S., Schwan, C.: Energy-efficient shortest routes for electric and hybrid vehicles. Transp. Res. Part B: Methodol. 103, 111\u2013135 (2017)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"655_CR63","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.trd.2016.01.001","volume":"43","author":"Z Sun","year":"2016","unstructured":"Sun, Z., Zhou, X.: To save money or to save time: intelligent routing design for plug-in hybrid electric vehicle. Transp. Res. Part D: Transp. Environ. 43, 238\u2013250 (2016)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"655_CR64","unstructured":"Sweda, T.M., Dolinskaya, I.S., Klabjan, D.: Adaptive Routing and Recharging Policies for Electric Vehicles. Working paper no. 14-02, Northwestern University, Illinois (2014)"},{"issue":"3","key":"655_CR65","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1080\/19397038.2011.592956","volume":"4","author":"WJ Sweeting","year":"2011","unstructured":"Sweeting, W.J., Hutchinson, A.R., Savage, S.D.: Factors affecting electric vehicle energy consumption. Int. J. Sustain. Eng. 4(3), 192\u2013201 (2011)","journal-title":"Int. J. Sustain. Eng."},{"key":"655_CR66","doi-asserted-by":"crossref","unstructured":"Tielert, T., Rieger, D., Hartenstein, H., Luz, R., Hausberger, S.: Can V2X communication help electric vehicles save energy? In: Proceedings of the 12th International Conference on ITS Telecommunications (ITST\u201912), pp. 232\u2013237. IEEE (2012)","DOI":"10.1109\/ITST.2012.6425172"},{"issue":"3","key":"655_CR67","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1109\/TITS.2013.2261064","volume":"14","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Jiang, J., Mu, T.: Context-aware and energy-driven route optimization for fully electric vehicles via crowdsourcing. IEEE Trans. Intell. Transp. Syst. 14(3), 1331\u20131345 (2013)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"1","key":"655_CR68","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02187894","volume":"3","author":"A Wiernik","year":"1988","unstructured":"Wiernik, A., Sharir, M.: Planar realizations of nonlinear Davenport\u2013Schinzel sequences by segments. Discret. Comput. Geom. 3(1), 15\u201347 (1988)","journal-title":"Discret. Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00655-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-019-00655-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00655-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:44:58Z","timestamp":1778492698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-019-00655-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,3]]},"references-count":68,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["655"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00655-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,3]]},"assertion":[{"value":"17 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}