Solving the Electric Capacitated Vehicle Routing Problem with Cargo Weight

Abstract

Electric vehicle routing problems are challenging variations of the traditional vehicle routing problem which incorporate the possibility of electric vehicle (EV) recharging at any station, while satisfying the delivery demands of customers. This work addresses the recently formulated capacitated vehicle routing problem (E-CVRP) with variable energy consumption rate. In particular, the cargo weight, which is one of the main factors affecting the energy consumption rate of EVs, is considered (i.e., the heavier the EV the higher the rate). As a solution method, an ant colony optimization algorithm with a local search heuristic is developed. Experiments are conducted on a recently generated benchmark set of E-CVRP instances demonstrating that the performance of the proposed technique improves on the best known so far solutions.