Studies On The Electric Vehicle-Routing Problem With Time Windows

To reduce gas emissions,transportation companies are trying to use electric vehicle(EV)to substitute traditional fuel vehicle.However,decision makers are plagued by low capacity of the batteries and long recharging time of EVs.To resolve the issues,many recharging stations have been set up in different locations.Meanwhile,super recharging stations are gradually emerging in the surrounding.They are the background of this thesis.In this thesis,we firstly propose a two-stage heuristic algorithm to solve E-VRPTW.The procedure of the algorithm divides into two separated processes,one is minimizing the total routes number the other is minimizing total distance.We then extend the E-VRPTW to be electric vehicle routing problem with time windows and heterogeneous recharging stations(E-VRPTWH)by adding the elements of super recharging stations.Subsequently,in addition to the updated two stage heuristic algorithm,we apply a novel partial enumeration(PE)operator to solve the new proposed problem aiming at minimizing the traveling cost as well as total recharging cost.Next,we demonstrate the experimental results of the approaches by comparing it with other algorithms on several sets of benchmark instances.Furthermore,we provide analysis on the impact of super recharging stations to the total cost of the logistic plan from three perspectives and hope to give a valuable reference to later studies.