EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning

Yucheng Du, Liwei Zhu

Applied Sciences · 16.11.2026 · 16 (22) · 11346

DOI: 10.3390/app162211346 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 16.11.2026. Verfasst von Yucheng Du und 1 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Special Fund for Basic Research of Central Public Welfare Research Institutes, Research Institute of Highway, Ministry of Transport.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Electric heavy-truck battery swapping stations (BSSs) face coupled challenges in practical operation, including uncertain swapping demand, time-of-use (TOU) electricity-price fluctuations, and difficult on-site battery dispatch. This paper proposes a robust optimal scheduling method based on the Distributionally Robust Soft Actor–Critic (DR-SAC) algorithm. First, a battery-cluster model based on state-of-charge (SOC) classification compresses the decision space into level-wise charging-count scheduling, reducing dimensionality. Second, the scheduling problem is formulated as a Robust Markov Decision Process (RMDP), optimizing the worst-case entropy-regularized cumulative reward within a Kullback–Leibler (KL) divergence-constrained ambiguity set. To cope with the unknown transition kernel in offline learning, a Variational Auto-Encoder (VAE) estimates the transition distribution from historical data, while a strong-duality transformation and functional approximation efficiently solve the robust Bellman operator. Results show that under joint upward perturbations of demand and price, the relative variation in the daily profit of DR-SAC is 3.7%, and the peak-shaving rate reaches 78.9% at a KL radius δ of 0.067 calibrated from historical forecasting errors. Across varying demand intensities, DR-SAC ranks first in daily profit with the smallest run-to-run variation among the compared algorithms on the studied station. DR-SAC provides a practical scheduling solution for electric heavy-truck BSSs under multiple uncertainties.

Förderung

  • Special Fund for Basic Research of Central Public Welfare Research Institutes, Research Institute of Highway, Ministry of Transport

Zitieren

APA

Du, Y., & Zhu, L. (2026). Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning. Applied Sciences, 16(22), 11346. https://doi.org/10.3390/app162211346

Vancouver

Du Y, Zhu L. Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning. Applied Sciences. 2026;16(22):11346. doi:10.3390/app162211346

BibTeX
@article{Du2026,
  author = {Du, Yucheng and Zhu, Liwei},
  title = {Optimal Scheduling of Electric Heavy-Truck Battery Swapping Stations via Distributionally Robust Deep Reinforcement Learning},
  journal = {Applied Sciences},
  year = {2026},
  volume = {16},
  number = {22},
  pages = {11346},
  doi = {10.3390/app162211346}
}
Kostenlos starten →