Charging scheduling optimisation of battery electric buses with charging setup time

被引:0
|
作者
Wang, Zhixin [1 ]
Zheng, Feifeng [1 ]
Hamdan, Sadeque [2 ]
Jouini, Oualid [3 ]
机构
[1] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai, Peoples R China
[2] Bangor Univ, Bangor Business Sch, Bangor LL57 2DG, Wales
[3] Univ Paris Saclay, Lab Genie Ind, CentraleSupelec, Paris, France
基金
中国国家自然科学基金;
关键词
Charging scheduling; battery-degradation cost; setup time; overnight charging; battery electric bus; GROUPING GENETIC ALGORITHM; TRAVELING SALESMAN PROBLEM; INFRASTRUCTURE; VEHICLES; MODEL; NETWORK;
D O I
10.1080/00207543.2024.2424973
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页数:26
相关论文
共 50 条
  • [1] Overnight charging scheduling of battery electric buses with uncertain charging time
    Feifeng Zheng
    Zhaojie Wang
    Ming Liu
    Operational Research, 2022, 22 : 4865 - 4903
  • [2] Overnight charging scheduling of battery electric buses with uncertain charging time
    Zheng, Feifeng
    Wang, Zhaojie
    Liu, Ming
    OPERATIONAL RESEARCH, 2022, 22 (05) : 4865 - 4903
  • [3] Overnight Charging Scheduling Optimization for Electric Battery Buses with Controllable Charging Completion Levels
    Zheng, Feifeng
    Wang, Zhixin
    Xu, Yinfeng
    Liu, Ming
    JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS, 2024, 150 (03)
  • [4] Daytime and Overnight Joint Charging Scheduling for Battery Electric Buses Considering Time-Varying Charging Power
    Zheng, Feifeng
    Wang, Zhixin
    Wang, Zhaojie
    Liu, Ming
    SUSTAINABILITY, 2023, 15 (13)
  • [5] Real-Time Charging Scheduling and Optimization of Electric Buses in a Depot
    Verbrugge, Boud
    Rauf, Abdul Mannan
    Rasool, Haaris
    Abdel-Monem, Mohamed
    Geury, Thomas
    El Baghdadi, Mohamed
    Hegazy, Omar
    ENERGIES, 2022, 15 (14)
  • [6] Joint optimization of vehicle scheduling and charging strategies for electric buses to reduce battery degradation
    Li, Xinran
    Wang, Wei
    Jin, Kun
    Qin, Shaoyang
    JOURNAL OF RENEWABLE AND SUSTAINABLE ENERGY, 2024, 16 (04)
  • [7] A novel integration of scheduling and dynamic wireless charging planning models of battery electric buses
    Alwesabi, Yaseen
    Liu, Zhaocai
    Kwon, Soongeol
    Wang, Yong
    ENERGY, 2021, 230
  • [8] Stochastic fast charging scheduling of battery electric buses with energy storage systems design
    Zheng, Feifeng
    Cao, Runfeng
    Liu, Ming
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 191
  • [9] An optimal charging scheduling model and algorithm for electric buses
    Bao, Zhaoyao
    Li, Jiapei
    Bai, Xuehan
    Xie, Chi
    Chen, Zhibin
    Xu, Min
    Shang, Wen-Long
    Li, Hailong
    APPLIED ENERGY, 2023, 332
  • [10] Smart and sustainable scheduling of charging events for electric buses
    Jarvis, Padraigh
    Climent, Laura
    Arbelaez, Alejandro
    TOP, 2024, 32 (01) : 22 - 56