Abstract This paper introduces a powerful, efficient and generic framework for optimal routing of electric vehicles in the setting of flexible edge cost functions and arbitrary initial states. More precisely, the introduced state-based routing problem is a consolidated model covering energy-efficiency and time-dependency. Given two vertices and an initial state the routing problem is to find optimal paths yielding minimal final states, while the profile routing problem is to find optimal paths for all initial states. A universal method for applying shortest path techniques to profile routing is developed. To show the genericity and efficiency of this approach it is instantiated for two typical shortest path algorithms, namely for A* and Contraction Hierarchies. Especially using the latter, a highly efficient solution for energy-efficient profile routing is obtained.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Efficient Profile Routing for Electric Vehicles

    Schonfelder, R. / Leucker, M. / Walther, S. | British Library Conference Proceedings | 2014


    Electric Vehicles Energy Efficient Routing Using Ant Colony Optimization

    Rawashdeh, Osamah / Abousleiman, Rami / Boimer, Romi | SAE Technical Papers | 2017


    Efficient algorithms for electric vehicles’ min-max routing problem

    Seyed Sajjad Fazeli / Saravanan Venkatachalam / Jonathon M. Smereka | DOAJ | 2024

    Free access

    Energy Efficient Routing for Electric Vehicles using Particle Swarm Optimization

    Abousleiman, R. / Rawashdeh, O. / Society of Automotive Engineers | British Library Conference Proceedings | 2014


    Development of an Energy-Efficient Routing Algorithm for Electric Vehicles

    Garcia, Aries G. / Tria, Lew Andrew R. / Talampas, Marc Caesar R. | IEEE | 2019