Ant colony optimization (ACO) algorithms have proved to be powerful tools to solve difficult optimization problems. In this paper, ACO is applied to the electric vehicle routing problem (EVRP). New challenges arise with the consideration of electric vehicles instead of conventional vehicles because their energy level is affected by several uncertain factors. Therefore, a feasible route of an electric vehicle (EV) has to consider visit(s) to recharging station(s) during its daily operation (if needed). A look ahead strategy is incorporated into the proposed ACO for EVRP (ACO-EVRP) that estimates whether at any time EVs have within their range a recharging station. From the simulation results on several benchmark problems it is shown that the proposed ACO-EVRP approach is able to output feasible routes, in terms of energy, for a fleet of EVs.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Ant Colony optimization for the Electric Vehicle Routing Problem




    Publication date :

    2018-11-01


    Size :

    411323 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Solving a Vehicle Routing Problem using Ant Colony Optimization Based Algorithm

    Tiwari, M. K. / Kumar, R. R. / Kumar, R. et al. | British Library Conference Proceedings | 2002


    Capacitated Vehicle Routing Problem using Ant Colony Optimization and PuLP Library

    Umbrani, Kunal / Choreria, Pratham / Kulkarni, Pradnya V. et al. | IEEE | 2025