IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i10p3538-3563.html
   My bibliography  Save this article

Charging scheduling optimisation of battery electric buses with charging setup time

Author

Listed:
  • Zhixin Wang
  • Feifeng Zheng
  • Sadeque Hamdan
  • Oualid Jouini

Abstract

Battery electric buses (BEBs) are recognised as sustainable modes of transportation. Because of its increasing range, efficient and convenient overnight charging has become crucial. The limited number of charging stations and variability in setup times require the optimisation of BEB charging schedules. This study proposes an optimal overnight centralised charging schedule that considers setup time and battery-degradation costs. We model this as a multi-travelling salesman problem with sojourn time to minimise operating costs, including electricity, setup time, and battery wear, while adhering to the bus-schedule constraints. We introduce a local search grouping genetic algorithm with a 2-opt operator local search to address the complexities of public-transport networks. Our extensive numerical analysis, grounded in real-world data, shows a 4.48% reduction in operating costs using our optimised strategy compared with current methods. Moreover, our charging-station allocation analysis provides insights for resource optimisation, advancing sustainable public transport, and charging strategies. This study contributes to the field of sustainable public transportation and charging optimisation.

Suggested Citation

  • Zhixin Wang & Feifeng Zheng & Sadeque Hamdan & Oualid Jouini, 2025. "Charging scheduling optimisation of battery electric buses with charging setup time," International Journal of Production Research, Taylor & Francis Journals, vol. 63(10), pages 3538-3563, May.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:10:p:3538-3563
    DOI: 10.1080/00207543.2024.2424973
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2424973
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2424973?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:63:y:2025:i:10:p:3538-3563. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.