Electric Vehicle Routing Problem Using Timed Petri Nets and Optimization Algorithm

Abdelha Outalha, Yassine Lakhal, Fatima Zahra Baghli and Fouzia Kzaiber

Vehicle Routing Problems (VRP) consist of determining and minimizing the cost of the route of a fleet of vehicles to serve a set of customers. The different courses must start and end in a place called depot. This paper deals with this problem and take electric vehicles as a case study (Electric-VRP), and our proposal focuses on the adaptive management and control of electric vehicles tours. To do so, Timed Petri Nets (TPNs) model is first developed to model and study the system behaviour. Then an adaptive control strategy based on linear programming is proposed for the management of electric vehicle tours. The control logic is shared between two components of the system. The slave (TPNs model) control the customer distribution and phases transitions. The master (controller) decides the customer be served first, second, third, until the last customer, gives the time service and the state of charge (SoC) of the battery which must be between 10% and 80% because the calculations will be linked to fast charging (between 20 and 30 minutes), to have the most optimal path. Furthermore, we thought to make this work to change the literature slightly from representation and analysis and show that the use of Petri Nets as a modelling tool is useful for this type of problem. Moreover, the obtained results are analyzed and discussed. Our control strategy is validated through these results.

Volume 12 | 05-Special Issue

Pages: 1109-1115

DOI: 10.5373/JARDCS/V12SP5/20201864