Vehicle Routing Problem With Mixed Fleet Of Conventional And Heterogenous Electric Vehicles And Time Dependent Charging Costs

Abstract

In this paper, we consider the vehicle routing problem<br> with mixed fleet of conventional and heterogenous electric vehicles<br> and time dependent charging costs, denoted VRP-HFCC, in which<br> a set of geographically scattered customers have to be served by a<br> mixed fleet of vehicles composed of a heterogenous fleet of Electric<br> Vehicles (EVs), having different battery capacities and operating<br> costs, and Conventional Vehicles (CVs). We include the possibility<br> of charging EVs in the available charging stations during the routes<br> in order to serve all customers. Each charging station offers charging<br> service with a known technology of chargers and time dependent<br> charging costs. Charging stations are also subject to operating time<br> windows constraints. EVs are not necessarily compatible with all<br> available charging technologies and a partial charging is allowed.<br> Intermittent charging at the depot is also allowed provided that<br> constraints related to the electricity grid are satisfied.<br> The objective is to minimize the number of employed vehicles and<br> then minimize the total travel and charging costs.<br> In this study, we present a Mixed Integer Programming Model and<br> develop a Charging Routing Heuristic and a Local Search Heuristic<br> based on the Inject-Eject routine with different insertion methods. All<br> heuristics are tested on real data instances.