Abstract

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.

Highlights

  • Buses account for only a small number of all the vehicles on city roads, but their emissions take up a much higher portion of the total road emissions owing to their long operation time and distance [1]

  • The e-bus operation scenario we considered in Shenzhen has the unique route configuration and operational requirements which we named as the vehicle relocation constraint

  • Based on the aforementioned considerations, with the aim to generate applicable e-bus schedules in Shenzhen involving multi-depot, vehicle relocation constraint and partial charging, this paper developed an Large Neighborhood Search (LNS) heuristic which can effectively solve real-world e-bus scheduling instances including hundreds of trips

Read more

Summary

Introduction

Buses account for only a small number of all the vehicles on city roads, but their emissions take up a much higher portion of the total road emissions owing to their long operation time and distance [1]. While in the infeasible schedule, the e-bus starts one day’s operation from Shekou Port Depot, carrying out three service trips (two up trips and one down trip) after finishing, which needs a long-distance non-service travel to return to the base depot, Shekou Port Depot, at the end of the day. Such kind of long-distance non-service travel should be avoided as much as possible according to the transit agency.

Literature Review
E-bus Scheduling
Application of LNS in Solving EVSP and EVRP
Problem Description
MIP Model
Large Neighborhood Search Heuristic
Heuristic Framework
Solution Formulation Heuristic
Procedure
Local Search
Data Preperation
Cases with Single Route
Cases with Multiple Routes
Comparison of the cost and cost ofmulti-route single route and multi-ro
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.