We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/A two-stage stochastic programming model of coordinated electric bus charging scheduling for a hybrid charging scheme
PeriodicalsComputer Science & Information Technology

A two-stage stochastic programming model of coordinated electric bus charging scheduling for a hybrid charging scheme

Checking your access to this record.

Abstract & Overview

This paper proposes a coordinated charging scheduling approach for battery electric buses (BEBs) in a hybrid charging scheme, i.e., both plug-in fast charging and battery-swapping charging modes are incorporated in a single charging station. To accommodate the uncertain battery energy consumption during bus operation, a two-stage stochastic program is formulated, where the first stage decision determines the battery inventory level of each station and the second stage determines the charging mode and designs when, where, and how long each bus should be charged. Future uncertainties associated with energy consumption are captured by a set of possible discrete scenarios from historical data. A progressive hedging algorithm is developed to decompose the two-stage stochastic program into sub-problems. A case study is conducted to verify the proposed models and solution algorithms.

Cite this record

Di Huang, Shuaian Wang (2022). A two-stage stochastic programming model of coordinated electric bus charging scheduling for a hybrid charging scheme. Multimodal Transportation, 1(1), 100006–100006. https://doi.org/10.1016/j.multra.2022.100006

Copy in another style

Huang, D., & Wang, S. (2022). A two-stage stochastic programming model of coordinated electric bus charging scheduling for a hybrid charging scheme. Multimodal Transportation, 1(1), 100006–100006. https://doi.org/10.1016/j.multra.2022.100006
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.