Optimal route planning for electric vehicles in large networks

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1108-1113

  Eisner, Jochen ^a   Funke, Stefan ^a   Storandt, Sabine ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA; ENERGY EFFICIENT; ENERGY RECUPERATION; ENERGY SUPPLIES; LARGE NETWORKS; OPTIMAL ROUTES; PREPROCESSING PHASE; QUERY TIME; ROAD NETWORK; ROUTE PLANNING; SHORTEST PATH; SPEED-UPS;

ARTIFICIAL INTELLIGENCE; ELECTRIC VEHICLES; ENERGY UTILIZATION; MOTOR TRANSPORTATION; ROADS AND STREETS;

ENERGY EFFICIENCY;

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

References (8)

1. Artmeier, A.; Haselmayr, J.; Leucker, M.; and Sachenbacher, M. 2010. The shortest path problem revisited: Optimal routing for electric vehicles. In 33rd Annual German Conference on Artificial Intelligence (KI-2010).
2. Batz, G. V.; Delling, D.; Sanders, P.; and Vetter, C. 2009. Time-dependent contraction hierarchies. In Finocchi, I., and Hershberger, J., eds., ALENEX, 97-105. SIAM.
3. Delling, D., and Wagner, D. 2009. Time-dependent route planning. In Ahuja, R.; Mhring, R.; and Zaroliagis, C., eds., Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, 207-230. Springer Berlin / Heidelberg.
4. Dreyfus, S. E. 1968. An appraisal of some shortest path algorithms. In ORSA/TIMS Joint National Mtg., volume 16, 166.
5. Fredman, M. L., and Tarjan, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34:596-615.
6. Geisberger, R.; Sanders, P.; Schultes, D.; and Delling, D. 2008. Contraction hierarchies: faster and simpler hierarchical routing in road networks. In Proceedings of the 7th international conference on Experimental algorithms, WEA'08, 319-333. Berlin, Heidelberg: Springer-Verlag.
7. Johnson, D. B. 1973. A note on dijkstra's shortest path algorithm. J. ACM 20:385-388.
8. Johnson, D. B. 1977. Efficient algorithms for shortest paths in sparse networks. J. ACM 24:1-13.