In this paper, we propose a new approach to dynamic wireless charging that allows electric vehicles to charge wirelessly while in motion in both lanes on highways. The challenge is to locate the charging infrastructure on a highway between origin O and destination S (round trip) with heterogeneous battery vehicles, where each type of vehicle requires its allocation of charging segments on the road. We aim to ensure that each type of vehicle can complete a round trip without running out of battery charge while minimizing the number of charging segments and inverters on the road by studying both lanes simultaneously. We model the problem mathematically and validate it using a CPLEX optimizer for limited instances. Finally, we solve the problem using a hybrid approach that combines genetic algorithms and local search techniques to balance diversification and intensification. We have significantly improved the results found in the literature by reducing the number of inverters, which are expensive components in the charging infrastructure. Our approach takes advantage of utilizing a single inverter for both lanes of the highway, leading to cost savings and improved efficiency.

Dynamic wireless charging (DWC) facilitates the travel of electric vehicles (EVs) on highways because it can charge EVs without contact and it does not have a recharging time as it can charge vehicles in motion by a set of power transmitters on the road. This work considers a highway road with DWC and a fleet of electric vehicles with heterogeneous batteries to begin a trip from the origin of the highway noted by O to the destination noted by S. As the usage of DWC is not free, this study seeks to install entry gates to the DWC if the vehicles need to charge their batteries and exit gates to the main road if the vehicles wish to stop the recharge. For this purpose, the first objective is to minimize the usage cost paid by each vehicle type to use the DWC during the trip on the highway. The second objective is to find the lower installation cost of the gates on the road. This work proposes to model the problem as a mathematical problem and validate it with the CPLEX optimizer using limited instances and, finally, solves the problem using the non-dominated sorting genetic algorithm (NSGA-II).

Electrification of transport will help to minimize CO2 and greenhouse gas emissions worldwide, but electrified transport requires planning of charging networks under a set of constraints, for a user-friendly environment, to encourage adoption. Induction charging of electric vehicles is among the effective solutions to overcome several constraints in the pacification, it is a contactless charging technology between the energy source and the vehicle. However, in practice, there are areas where the installation of induction charging technology is impossible, for this reason, in this work we have focused on the two charging modes of electric vehicles; dynamic mode and static mode. We propose a mathematical modeling, which answers the planning problem of charging infrastructure with both modes. i.e. the location of recharging segments and inverters in the road for the dynamic recharging on the one hand and on the other hand recharging stations for the static mode, which ensures the movement of a heterogeneous fleet of vehicles in the network. Our objectives are to minimize the cost of the infrastructure and to get the greatest lifetime of batteries, since the battery is the main unit of each vehicle.

The dynamic wireless charging system (DWCS) facilitates the electric vehicle (EV) trip on highways because it can charge EV while in motion. The DWCS comprises recharging segments occupied by an induction cable and inverters supplying the induction cables. We consider a highway road with recharging segments and a fleet of vehicles with heterogeneous batteries. Each vehicle type may enter the segment through the entry gate at the segment’s start to load, and they cannot exit the segment until the segment exit gate. Vehicles have to pay a unit cost for using the charging segment, so the full use of the segments is expensive for vehicles. Our objective in this work is to create new entry and exit gates on each charging segment to minimize the total cost for using the charging segment by vehicles. Due to the heterogeneity of the batteries, the segment’s use differs from one vehicle to another, so the opening of new segment gates for each type is expensive; for this, we seek to minimize the gates number of each recharging segment. We propose to model the problem as a mathematical problem and solve it by CPLEX optimizer for limited instances.