TY - JOUR
T1 - A stochastic scheduling, allocation, and inventory replenishment problem for battery swap stations
AU - Asadi, Amin
AU - Nurre Pinkley, Sarah
N1 - Funding Information:
This research is supported by the Arkansas High Performance Computing Center which is funded through multiple National Science Foundation grants and the Arkansas Economic Development Commission.
Publisher Copyright:
© 2020
PY - 2021/2
Y1 - 2021/2
N2 - Electric vehicles and drones promise to transform transportation systems and supply chains. However, long recharge times and battery degradation inhibit adoption. To overcome these barriers, swap stations enable quick battery exchange. We introduce a stochastic scheduling, allocation, and inventory replenishment problem which determines the charging, discharging, and replacement decisions at a swap station over time. The decisions are complex because recharging is necessary for short-term operation but causes degradation and the need for future replacement. We model the problem as a Markov Decision Process, solve it using backward induction, and show that the problem suffers from the curses of dimensionality. Hence, we propose two approximate methods, a heuristic benchmark policy and a reinforcement learning method, which provide high-quality solutions. Using a designed experiment, we deduce effective operational insights.
AB - Electric vehicles and drones promise to transform transportation systems and supply chains. However, long recharge times and battery degradation inhibit adoption. To overcome these barriers, swap stations enable quick battery exchange. We introduce a stochastic scheduling, allocation, and inventory replenishment problem which determines the charging, discharging, and replacement decisions at a swap station over time. The decisions are complex because recharging is necessary for short-term operation but causes degradation and the need for future replacement. We model the problem as a Markov Decision Process, solve it using backward induction, and show that the problem suffers from the curses of dimensionality. Hence, we propose two approximate methods, a heuristic benchmark policy and a reinforcement learning method, which provide high-quality solutions. Using a designed experiment, we deduce effective operational insights.
KW - Battery degradation
KW - Drones
KW - Electric vehicles
KW - Markov decision processes
KW - Reinforcement learning
KW - Scheduling allocation and inventory replenishment problems
UR - http://www.scopus.com/inward/record.url?scp=85099251710&partnerID=8YFLogxK
U2 - 10.1016/j.tre.2020.102212
DO - 10.1016/j.tre.2020.102212
M3 - Article
AN - SCOPUS:85099251710
SN - 1366-5545
VL - 146
JO - Transportation Research Part E: Logistics and Transportation Review
JF - Transportation Research Part E: Logistics and Transportation Review
M1 - 102212
ER -