Efficient energy-optimal routing for electric vehicles

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1402-1407

  Sachenbacher, Martin ^a   Leucker, Martin ^b   Artmeier, Andreas ^a   Haselmayr, Julian ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BATTERY CAPACITY; ENERGY VALUE; HEURISTIC FUNCTIONS; PREPROCESSING TECHNIQUES; QUERY TIME; REAL ROAD NETWORKS; RUNTIMES; SHORTEST PATH; STANDARD ALGORITHMS; VEHICLE WEIGHTS;

ARTIFICIAL INTELLIGENCE; ELECTRIC VEHICLES; HEURISTIC ALGORITHMS; MOTOR TRANSPORTATION; NETWORK ROUTING; OPTIMIZATION;

COSTS;

EID: 80055059206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Artmeier, A.; Haselmayr, J.; Leucker, M.; and Sachenbacher, M. 2010. The shortest path problem revisited: Optimal routing for electric vehicles. In KI'10.
2. Bast, H.; Funke, S.; Sanders, P.; and Schultes, D. 2007. Fast routing in road networks with transit nodes. Science 316(5824):566. (Pubitemid 46683135)
3. Bellman, R. 1958. On a routing problem. Quarterly of Applied Mathematics. 16(1):87-90.
4. Dijkstra, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269-271.
5. Garey, M., and Johnson, D. 1979. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
6. Geisberger, R.; Sanders, P.; Schultes, D.; and Delling, D. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Proc. WEA'08.
7. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. on Sys. Science and Cybernetics 4(2):100-107.
8. Johnson, D. B. 1977. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24(1):1-13.
9. Joksch, H. C. 1966. The shortest route problem with constraints. J. of Math. Analysis and Applications 14:191-197.
10. Mehlhorn, K., and Sanders, P. 2008. Data Structures and Algorithms. The Basic Toolbox. Springer.
11. Neubauer, S. 2010. Planung energieeffizienter Routen in Straßennetzwerken. Master's thesis, Karlsruhe Inst. of Tech.
12. Pallottino, S. 1984. Shortest-path methods: Complexity, interrelations and new propositions. Networks 14(2):257-267. (Pubitemid 14589468)
13. Sanders, P., and Schultes, D. 2005. Highway hierarchies hasten exact shortest path queries. In ESA'05.
14. Zhan, F. B., and Noon, C. E. 1998. Shortest path algorithms: An evaluation using real road networks. Transportation Science 32:65-73. (Pubitemid 128610041)