Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery

This paper addresses the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery (EVRP-SPD), in which electric vehicles (EVs) simultaneously deliver goods to pick up from customers. Due limited battery capacity of EVs, their range is shorter than that internal combustion vehicles. In EVRP, addition depot customers, there are also charging stations (CS) because EVs need be charged when empty. The problem formulated as an integer linear model, efficient solution proposed minimize total distance traveled. To create a feasible initial solution, Clarke Wright’s savings algorithm used. Several variants variable neighborhood search tested, reduced-variable used find best reasonable time. Computer experiments performed benchmark instances evaluate effectiveness our approach terms quality obtained results show method can achieve solutions time all instances.