Optimization of EV bus charging schedule by stochastic programming

In recent years, introducing electric vehicle (EV) buses, their charging equipment and infrastructures has become an urgent issue. The purpose of this study is to propose a scheduling model that minimizes the total charging time of EV buses as a makespan using multiple EV buses and chargers, considering fluctuations in the charging time of each EV bus. Generally, directly solving a problem with probabilistic constraints is difficult, thus it often convert into a deterministic equivalent of stochastic program. Therefore, first, this study solved the relaxed problem of deterministic equivalent and assigned each EV bus to each charger using branch and bound (BB) method. Then, it introduced the probabilistic constraints for calculating the exact value of the makespan. The results of numerical experiments demonstrated the effectiveness of this solution.