IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v18y2025i16p4440-d1729010.html
   My bibliography  Save this article

Interactive Optimization of Electric Bus Scheduling and Overnight Charging

Author

Listed:
  • Zvonimir Dabčević

    (Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb, 10002 Zagreb, Croatia)

  • Joško Deur

    (Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb, 10002 Zagreb, Croatia)

Abstract

The transition to fully electric bus (EB) fleets introduces new challenges in coordinating daily operations and managing charging energy needs, while accounting for infrastructure constraints. The paper proposes a three-stage optimization framework that integrates EB scheduling with overnight charging under realistic depot layout constraints. In the first stage, a mixed-integer linear program (MILP) determines the minimum number of EBs with ample batteries and related schedules to complete all timetabled trips. With the fleet size fixed, the second stage minimizes the EB battery capacity by optimizing trip assignments. In the third stage, charging schedules are iteratively optimized for different numbers of chargers to minimize charger power capacity and charging cost, while ensuring each EB is fully recharged before its first trip on the following day. The matrix-shape depot layout imposes spatial and operational constraints that restrict the charging and movement of EBs based on their parking positions, with EBs remaining stationary overnight. The entire process is repeated by incrementing the fleet size until a saturation point is reached, beyond which no further reduction in battery capacity is observed. This results in a Pareto frontier showing trade-offs between required battery capacity, number of chargers, charger power capacity, and charging cost. The proposed method is applied to a real-world airport parking shuttle service, demonstrating its potential to reduce the battery size and charging infrastructure demands while maintaining full operational feasibility.

Suggested Citation

  • Zvonimir Dabčević & Joško Deur, 2025. "Interactive Optimization of Electric Bus Scheduling and Overnight Charging," Energies, MDPI, vol. 18(16), pages 1-26, August.
  • Handle: RePEc:gam:jeners:v:18:y:2025:i:16:p:4440-:d:1729010
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/18/16/4440/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/18/16/4440/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gkiotsalitis, K. & Iliopoulou, C. & Kepaptsoglou, K., 2023. "An exact approach for the multi-depot electric bus scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 306(1), pages 189-206.
    2. Kalghatgi, Gautam, 2018. "Is it really the end of internal combustion engines and petroleum in transport?," Applied Energy, Elsevier, vol. 225(C), pages 965-974.
    3. Wu, Weitiao & Lin, Yue & Liu, Ronghui & Jin, Wenzhou, 2022. "The multi-depot electric vehicle scheduling problem with power grid characteristics," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 322-347.
    4. Jakov Topić & Jure Soldo & Filip Maletić & Branimir Škugor & Joško Deur, 2020. "Virtual Simulation of Electric Bus Fleets for City Bus Transport Electrification Planning," Energies, MDPI, vol. 13(13), pages 1-24, July.
    5. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    6. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhou, Yu & Wang, Hua & Wang, Yun & Yu, Bin & Tang, Tianpei, 2024. "Charging facility planning and scheduling problems for battery electric bus systems: A comprehensive review," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    2. Wang, Zhixin & Zheng, Feifeng & Hamdan, Sadeque & Jouini, Oualid, 2025. "On the spatio-temporal optimization for the charging scheduling of battery electric buses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
    3. 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).
    4. Wang, Yiran & Chen, Jingxu & Tang, Tianli & Liu, Zhiyuan, 2024. "A holistic approach to multi-depot electric bus scheduling for energy saving considering limitations in charging facilities," Energy, Elsevier, vol. 303(C).
    5. Zou, Kaijie & Zhang, Ke & Li, Meng, 2024. "Operational design for modular electrified transit in corridor areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    6. Matina L. Y. Chau & Diamanto Koutsompina & Konstantinos Gkiotsalitis, 2024. "The Electric Vehicle Scheduling Problem for Buses in Networks with Multi-Port Charging Stations," Sustainability, MDPI, vol. 16(3), pages 1-21, February.
    7. Naihui Wang & Yulong Pei & Yi-Jia Wang, 2022. "Antecedents in Determining Users’ Acceptance of Electric Shuttle Bus Services," Mathematics, MDPI, vol. 10(16), pages 1-19, August.
    8. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    9. Kale, Aneesh Vijay & Krishnasamy, Anand, 2023. "Experimental study of homogeneous charge compression ignition combustion in a light-duty diesel engine fueled with isopropanol–gasoline blends," Energy, Elsevier, vol. 264(C).
    10. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    11. McCluskey, Jac & Druitt, Tom & Larkin, Charles, 2025. "Sustainability in transit: Assessing the economic case for electric bus adoption in the UK," Transport Policy, Elsevier, vol. 162(C), pages 493-508.
    12. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    13. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    14. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    15. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    16. Yiling Li & Zhiwen Yang & Si Zhang & Wenting Liu, 2024. "A Study of the Capacitated Vehicle Routing Problem with Time-Window and Three-Dimensional Loading Constraints in Land–Sea Transport," Sustainability, MDPI, vol. 16(23), pages 1-26, November.
    17. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    18. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    19. Maciej Kozłowski & Andrzej Czerepicki, 2025. "Operational Energy Consumption Map for Urban Electric Buses: Case Study for Warsaw," Energies, MDPI, vol. 18(13), pages 1-19, June.
    20. Luiz Almeida & Ana Soares & Pedro Moura, 2023. "A Systematic Review of Optimization Approaches for the Integration of Electric Vehicles in Public Buildings," Energies, MDPI, vol. 16(13), pages 1-26, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:gam:jeners:v:18:y:2025:i:16:p:4440-:d:1729010. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.