Scheduling of EV Battery Swapping-Part II: Distributed Solutions

Pengcheng You, Steven Low, Liang Zhang, Ruilong Deng, Georgios B. Giannakis, Youxian Sun, Zaiyue Yang

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

In Part I of this paper, we formulate an optimal scheduling problem for battery swapping that assigns to each electric vehicle (EV) a best station to swap its depleted battery based on its current location and state of charge. The schedule aims to minimize a weighted sum of EVs' travel distance and electricity generation cost over both station assignments and power flow variables, subject to EV range constraints, grid operational constraints, and ac power flow equations. We propose there a centralized solution based on second-order cone programming relaxation of optimal power flow and generalized Benders decomposition that is applicable when global information is available. In this paper, we propose two distributed solutions based on the alternating direction method of multipliers and dual decomposition, respectively, that are suitable for systems where the distribution grid, stations, and EVs are managed by separate entities. Our algorithms allow these entities to make individual decisions, but coordinate through privacy-preserving information exchanges to solve a convex relaxation of the global problem. We present simulation results to show that both algorithms converge quickly to a solution that is close to optimum after discretization.

Original languageEnglish (US)
Article number8110720
Pages (from-to)1920-1930
Number of pages11
JournalIEEE Transactions on Control of Network Systems
Volume5
Issue number4
DOIs
StatePublished - Dec 2018

Keywords

  • Distributed algorithms
  • electric vehicle (EV)
  • joint battery swapping
  • optimal power flow (OPF)

Fingerprint Dive into the research topics of 'Scheduling of EV Battery Swapping-Part II: Distributed Solutions'. Together they form a unique fingerprint.

  • Cite this