Description:
Battery electric buses (BEBs) are rapidly being embraced by public transit agencies due to their sustainable and economic benefits. At present, due to the insufficient number of charging piles and the unreasonable allocation of charging resources, such phenomena as BEBs charging congestion and charging waiting frequently occur. Motivated by these facts, we study a BEB overnight charging scheduling problem with the objective of minimizing costs of electric charging and battery damage. We describe the overnight charging of BEBs as a parallel machine scheduling problem with a controllable task completion level. Moreover, the charging time function fitted based on the observational experimental data reduces the calculation time required by the discrete time method for this problem. Besides, we have developed an efficient heuristic algorithm for solving large-scale problems, numerical experiments have verified the effectiveness of the algorithm. In addition a real case study to demonstrate the applicability of our approaches