The bus transit system is promising to enable electric and autonomous vehicles for massive urban mobility, which relies on high-level automation and efficient resource management. Besides the on-road automation, the in-depot automated scheduling for battery recharging has not been adequately studied yet. This paper presents an integrated in-depot routing and recharging scheduling (IDRRS) problem, which is modeled as a constraint programming (CP) problem with Boolean satisfiability conditions (SAT). The model is converted to a flexible job-shop problem (FJSP) and is feasible to be solved by a CP-SAT solver for the optimal solution or feasible solutions with acceptable performance. This paper also presents a case study in Shanghai and compares the results from the FJSP model and the first come first serve (FCFS) method. The result demonstrates the allocation of routes and chargers under multiple scenarios with different numbers of chargers. Results show that the FJSP model shortens the delay and increases the time conservation for future rounds of operation than FCFS, while FCFS presents the simplicity of programming and better computational efficiency. The multiple random input test suggests that the proposed approach can decide the minimum number of chargers for stochastic charging requests. The proposed method can conserve the investment by increasing the utilization of automated recharging devices, improving vehicles' in-depot efficiency.

public transit;depot management;charging management