Optimization of Electric Vehicle Routing Problem Using Tabu Search

The electric vehicle routing problem (EVRP) is an extension of the traditional vehicle routing problem (VRP), where the conventional freight vehicles was replaced by electric vehicles. Since the electric vehicles have a limited battery capacity, they have to stop and are recharged at electric stations. To deal with this problem, a mixed-integer linear programming (MILP) model was developed for the EVRP and a Tabu Search (TS) algorithm is designed to solve it. Computational experiments were carried out based on Solomon’s instances to testify the efficiency of the proposed model and methods compared with the method by mathematic program software CPLEX.