Multi-Depot Electric Bus Scheduling Considering Operational Constraint and Partial Charging: A Case Study in Shenzhen, China

Electric buses (e-buses) demonstrate great potential in improving urban air quality thanks to zero tailpipe emissions and thus being increasingly introduced to the public transportation systems. In the transit operation planning, a common requirement is that long-distance non-service travel of the buses among bus terminals should be avoided in the schedule as it is not cost-effective. In addition, e-buses should begin and end a day of operation at their base depots. Based on the unique route configurations in Shenzhen, the above two requirements add further constraint to the form of feasible schedules and make the e-bus scheduling problem more difficult. We call these two requirements the vehicle relocation constraint. This paper addresses a multi-depot e-bus scheduling problem considering the vehicle relocation constraint and partial charging. A mixed integer programming model is formulated with the aim to minimize the operational cost. A Large Neighborhood Search (LNS) heuristic is devised with novel destroy-and-repair operators to tackle the vehicle relocation constraint. Numerical experiments are conducted based on multi-route operation cases in Shenzhen to verify the model and effectiveness of the LNS heuristic. A few insights are derived on the decision of battery capacity, charging rate and deployment of the charging infrastructure.

Automated summary

This paper addresses the multi-depot e-bus scheduling problem with the consideration of the vehicle relocation constraint and partial charging. A mixed integer programming model is formulated to minimize the operational cost, and a Large Neighborhood Search (LNS) heuristic is devised to tackle the vehicle relocation constraint. Numerical experiments based on multi-route operation cases in Shenzhen verify the model and effectiveness of the LNS heuristic.