IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v196y2025ics1366554525000626.html
   My bibliography  Save this article

Optimization of electric bus vehicle scheduling and charging strategies under Time-of-Use electricity price

Author

Listed:
  • Lu, Zhaoyang
  • Xing, Tianyi
  • Li, Yanfeng

Abstract

With the growing awareness of environmental protection and energy conservation, more and more cities choose to utilize electric buses (EBs) in their public transit systems. Due to the limitations of battery technology, many fully charged EBs are not enough to complete their daily tasks, which must be charged twice or more times per day. Besides, many cities encourage the off-peak electricity power consumption, and the charging cost of EBs during peak hours is often extremely high. From an economic viewpoint, it is thus one practical and urgent problem on how to decide the fleet size of EBs and organize their charging schedules for the bus companies. To solve this problem, this manuscript builds a mixed-integer programming (MIP) model via taking the scheduling and charging constraints of EBs into consideration. Also, one dynamic label setting-based branch and price (DLS-BP) algorithm is proposed accordingly, whose efficiency is further verified and compared with two heuristic algorithms via some numerical experiments.

Suggested Citation

  • Lu, Zhaoyang & Xing, Tianyi & Li, Yanfeng, 2025. "Optimization of electric bus vehicle scheduling and charging strategies under Time-of-Use electricity price," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).
    • Handle: RePEc:eee:transe:v:196:y:2025:i:c:s1366554525000626
    DOI: 10.1016/j.tre.2025.104021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525000626
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search 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:transe:v:196:y:2025:i:c:s1366554525000626. 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/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.