Electric Vehicle Routing Problem with Industry Constraints: Trends and Insights for Future Research

This paper presents and analyzes the one-to-many vehicle routing and scheduling problem with electric vehicles. Initially, focus is given on the problem formulation and the restrictions imposed in practice are examined. EVRP is NP-hard in the strong sense since it is natural extension of the well-known Capacitated Vehicle Routing Problem and requires substantial computational effort for determining optimal or near optimal solutions for medium and large scale problem instances. A comprehensive mathematical formulation is developed in order to model the EVRP and the multiple constraints appeared due to capacity limitations, time window restrictions and the predefined charging level of the vehicles. In addition, recent trends for the EVRP are analyzed producing valuable insights for future research regarding extra operational constraints, real-life data sets and solution frameworks that embody approximation algorithms for an efficient and effective search of the solution space.