Author
Listed:
- Wang, Yaoyao
- Jin, Jian Gang
- Ibarra-Rojas, Omar J.
- Xu, Min
- Cao, Zhichao
Abstract
Electric buses (EBs) play a vital role in environment protection and sustainable development. Because EBs have a limited driving range and relatively long daytime charging times, it is reasonable to redeploy drivers during charging to reduce idle time in crew schedules. Network-level vehicle and crew scheduling problems should consider labor regulations, deadheading insertions, and available time slots of vehicle usage. This paper develops a mixed integer nonlinear programming (MINLP) model to formulate this integrated optimization problem under an EB’s fast charging mode. In particular, two models are built involving two dispatching modes: a driver & EB binding mode and a freely-combined mode. A customized branch-and-price (B&P) algorithm is designed to cope with both MINLP models. Numerical tests and a real-world case study verify that the freely-combined mode reduces charging events and achieves 4.42% cost savings relative to the binding mode. In large-scale scenarios, the B&P algorithm exhibits superior computational efficiency and solution quality compared to Gurobi and a grouping genetic algorithm (as another benchmark). Finally, sensitivity analysis shows that the network integration optimization scheme can reduce the operation cost by 2.83%-11.94%. EB acquisition cost (54.44%-71.40%) and charging cost (6.81%-18.85%) are the key factors affecting the total cost, and their fluctuations will significantly affect the optimal scheduling scheme.
Suggested Citation
Wang, Yaoyao & Jin, Jian Gang & Ibarra-Rojas, Omar J. & Xu, Min & Cao, Zhichao, 2026.
"A branch-and-price algorithm for integrated optimization on vehicle and crew scheduling of electric bus system,"
Transportation Research Part B: Methodological, Elsevier, vol. 206(C).
Handle:
RePEc:eee:transb:v:206:y:2026:i:c:s0191261526000421
DOI: 10.1016/j.trb.2026.103430
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:206:y:2026:i:c:s0191261526000421. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.