Overnight charging scheduling of battery electric buses with uncertain charging time

被引:7
|
作者
Zheng, Feifeng [1 ]
Wang, Zhaojie [1 ]
Liu, Ming [2 ]
机构
[1] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai 200051, Peoples R China
[2] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
基金
中国国家自然科学基金;
关键词
Charging scheduling; Battery electric bus; Stochastic programming; Heuristic algorithm; AVERAGE APPROXIMATION METHOD; INFRASTRUCTURE; STRATEGIES; DESIGN;
D O I
10.1007/s12351-022-00740-y
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
With the rapid development of battery electric buses (BEBs) in urban public traffic, it arises the problem of BEB charging scheduling, which aims to supply electric power for all the BEBs to meet the bus timetable in the smallest cost. Practical experience reports that both weather temperature and accumulative battery using time have a non-negligible impact on battery charging efficiency, and bring about the uncertainty of charging time of a battery. It may cause a negative influence to the departure schedule of the BEBs. Motivated by the above observation, this work investigates a BEB charging scheduling problem with uncertain charging time. The objective is to minimize the expected total charging cost, which consists of in-service cost, energy consumption cost and penalty cost due to over-low charging. We first prove the strong NP-hardness of the considered problem. A stochastic linear programming model is then established. A scenario-reduction based enhanced sample average approximation approach and an improved genetic algorithm are proposed to solve large-scale instances of the considered problem. Numerical experiments and comparisons with adapted previous algorithms are conducted to demonstrate the effectiveness of the proposed approaches.
引用
收藏
页码:4865 / 4903
页数:39
相关论文
共 50 条
  • [1] Overnight charging scheduling of battery electric buses with uncertain charging time
    Feifeng Zheng
    Zhaojie Wang
    Ming Liu
    [J]. Operational Research, 2022, 22 : 4865 - 4903
  • [2] Overnight Charging Scheduling Optimization for Electric Battery Buses with Controllable Charging Completion Levels
    Zheng, Feifeng
    Wang, Zhixin
    Xu, Yinfeng
    Liu, Ming
    [J]. JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS, 2024, 150 (03)
  • [3] Daytime and Overnight Joint Charging Scheduling for Battery Electric Buses Considering Time-Varying Charging Power
    Zheng, Feifeng
    Wang, Zhixin
    Wang, Zhaojie
    Liu, Ming
    [J]. SUSTAINABILITY, 2023, 15 (13)
  • [4] 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
    [J]. ENERGIES, 2022, 15 (14)
  • [5] A novel integration of scheduling and dynamic wireless charging planning models of battery electric buses
    Alwesabi, Yaseen
    Liu, Zhaocai
    Kwon, Soongeol
    Wang, Yong
    [J]. ENERGY, 2021, 230
  • [6] Stochastic fast charging scheduling of battery electric buses with energy storage systems design
    Zheng, Feifeng
    Cao, Runfeng
    Liu, Ming
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 191
  • [7] Joint optimization of vehicle scheduling and charging strategies for electric buses to reduce battery degradation
    Li, Xinran
    Wang, Wei
    Jin, Kun
    Qin, Shaoyang
    [J]. JOURNAL OF RENEWABLE AND SUSTAINABLE ENERGY, 2024, 16 (04)
  • [8] 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
    [J]. APPLIED ENERGY, 2023, 332
  • [9] Smart and sustainable scheduling of charging events for electric buses
    Jarvis, Padraigh
    Climent, Laura
    Arbelaez, Alejandro
    [J]. TOP, 2024, 32 (01) : 22 - 56
  • [10] Smart and sustainable scheduling of charging events for electric buses
    Padraigh Jarvis
    Laura Climent
    Alejandro Arbelaez
    [J]. TOP, 2024, 32 : 22 - 56