Optimal Charging Schedule for a Battery Switching Station Serving Electric Buses

We propose a model of a battery switching station (BSS) for electric buses (EBs) that captures the predictability of bus operation. We schedule battery charging in the BSS so that every EB arrives to find a battery ready for switching. We develop an efficient algorithm to compute an optimal schedule...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 2016-09, Vol.31 (5), p.3473-3483
Main Authors: Pengcheng You, Zaiyue Yang, Yongmin Zhang, Low, Steven H., Youxian Sun
Format: Article
Language:English
Subjects:
Algorithms
Batteries
BSS
Charging
Computational modeling
Degradation
direct projection method
dual decomposition
EB-to-charging-box assignment
Electric batteries
Mathematical models
Optimal scheduling
Optimization
Real-time systems
Schedules
Stations
Switches
Switching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a model of a battery switching station (BSS) for electric buses (EBs) that captures the predictability of bus operation. We schedule battery charging in the BSS so that every EB arrives to find a battery ready for switching. We develop an efficient algorithm to compute an optimal schedule. It uses dual decomposition to decouple the charging decisions at different charging boxes so that independent subproblems can be solved in parallel at individual charging boxes, making the algorithm inherently scalable as the size of the BSS grows. We propose a direct projection method that solves these subproblems rapidly. Numerical results illustrate that the proposed approach is far more efficient and scalable than generic algorithms and existing solvers.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2015.2487273