Ant Colony optimization for the Electric Vehicle Routing Problem

Abstract

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.