The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient Energy-Optimal Routing for Electric Vehicles
Open accessAbstract
Traditionally routing has focused on finding shortest paths in networks with positive, static edge costs representing the distance between two nodes. Energy-optimal routing for electric vehicles creates novel algorithmic challenges, as simply understanding edge costs as energy values and applying standard algorithms does not work. First, edge costs can be negative due to recuperation, excluding Dijkstra-like algorithms. Second, edge costs may depend on parameters such as vehicle weight only known at query time, ruling out existing preprocessing techniques. Third, considering battery capacity limitations implies that the cost of a path is no longer just the sum of its edge costs. This paper shows how these challenges can be met within the framework of A* search. We show how the specific domain gives rise to a consistent heuristic function yielding an O(n2) routing algorithm. Moreover, we show how battery constraints can be treated by dynamically adapting edge costs and hence can be handled in the same way as parameters given at query time, without increasing run-time complexity. Experimental results with real road networks and vehicle data demonstrate the advantages of our solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
The electric location routing problem with time windows and partial recharging
Schiffer, M., & Walther, G. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.01.011 · Cited by 343
Pelletier, S., Jabali, O., & Laporte, G. (2016) · Transportation Science · doi:10.1287/trsc.2015.0646 · Cited by 314
Managing Electric Vehicles in the Smart Grid Using Artificial Intelligence: A Survey
Rigas, E. S., Ramchurn, S. D., & Bassiliades, N. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2376873 · Cited by 280
Online routing and battery reservations for electric vehicles with swappable batteries
Adler, J. D., & Mirchandani, P. B. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.09.005 · Cited by 103
Electric vehicles: A review of network modelling and future research needs
Jing, W., Yan, Y., Kim, I., & Sarvi, M. (2016) · Advances in Mechanical Engineering · doi:10.1177/1687814015627981 · Cited by 79
Metadata
- Authors
- Sachenbacher, M., Leucker, M., Artmeier, A., & Haselmayr, J.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2011-08-04
- Volume
- 25
- Issue
- 1
- Pages
- 1402-1407
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2167246044
- Cited by
- 176
- References
- 1
- FWCI
- 32.46
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Energy-Optimal Routing for Electric Vehicles. https://app.cochat.ai/papers/10.1609/aaai.v25i1.7803
- The paper
- Sachenbacher, M., Leucker, M., Artmeier, A., & Haselmayr, J. (2011). Efficient Energy-Optimal Routing for Electric Vehicles. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v25i1.7803
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.