The deployment of Electric Vehicles (EVs) is constrained mainly by the limited battery capacity, the limited number of charging stations and the recharging time. Our goal is to promote the use of EV by developing energy-efficient routing tools. To overcome the autonomy limitation we propose a methodology for the EV routing problem with recharging stage(s) along the way on the available charging stations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Electric vehicle shortest path problem with replenishment constraint


    Contributors:


    Publication date :

    2014-11-01


    Size :

    3409339 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic routing for the Electric Vehicle Shortest Path Problem with charging station occupancy information

    Dastpak, Mohsen / Errico, Fausto / Jabali, Ola et al. | Elsevier | 2023


    The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles

    Andreas Artmeier, Julian Haselmayr, Martin Leucker, Martin Sachenbacher | BASE | 2010

    Free access

    Robust Shortest Path Problem With Distributional Uncertainty

    Zhang, Yuli / Song, Shiji / Shen, Zuo-Jun Max et al. | IEEE | 2018


    Shortest path problem with arc failure scenarios

    Issac, Preethi / Campbell, Ann Melissa | Online Contents | 2017


    The Variance-Constrained Shortest Path Problem

    Sivakumar, Raj A. | Online Contents | 1994