Complexity of scheduling charging in the smart grid

Conference Paper

The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. For about 20 variants the problem is either in P or weakly NP-hard and dynamic programs exist to compute optimal solutions. About 10 other variants of the problem are strongly NP-hard, presenting a potentially significant obstacle to their use in practical situations of scale.

Duke Authors

Cited Authors

  • De Weerdt, MM; Conitzer, V; Albert, M; Van Der Linden, K

Published Date

  • January 1, 2018

Published In

Volume / Issue

  • 3 /

Start / End Page

  • 1924 - 1926

Electronic International Standard Serial Number (EISSN)

  • 1558-2914

International Standard Serial Number (ISSN)

  • 1548-8403

International Standard Book Number 13 (ISBN-13)

  • 9781510868083

Citation Source

  • Scopus