An approximate dynamic programming algorithm for short-term electric vehicle fleet operation under uncertainty

Research output: Contribution to journalJournal articleResearchpeer-review

Documents

  • Fulltext

    Accepted author manuscript, 903 KB, PDF document

This paper considers the dynamic problem of optimally operating a fleet of plug-in hybrid electric vehicles in a market environment. With uncertainty in future electricity prices and driving demands, we formulate a Markov decision process and determine a cost-minimizing policy for using the engine and charging and discharging the battery. As such, the policy is based on the trade-off between the costs of gasoline and electricity and between current and future power prices. To accommodate an inhomogeneous fleet composition and overcome the computational challenges of stochastic and dynamic optimization, including large-scale state and action spaces, we adopt the methodology of approximate dynamic programming. More specifically, using simulation and value function approximation by linear regression, we apply a least squares Monte Carlo method. This methodology allows for scaling with respect to fleet size and we are able to establish convergence of our algorithm for 100 vehicles by using 5000 samples in the simulation. Our results show that the vehicles should generally discharge the battery rather than using the engine unless battery capacity is insufficient to fully cover driving demand, but the timing of battery charging should be according to power prices. When comparing our policy to the simple policy of immediate charging, we demonstrate superiority for small and medium-sized fleets, with 2%–4% cost differences.

Original languageEnglish
Article number119793
JournalApplied Energy
Volume325
Number of pages15
ISSN0306-2619
DOIs
Publication statusPublished - 2022

Bibliographical note

Publisher Copyright:
© 2022 Elsevier Ltd

    Research areas

  • Approximate dynamic programming, Least squares Monte Carlo, Plug-in hybrid vehicles

ID: 318532949