Complexity of scheduling charging in the smart grid


Conference Paper

© 2018 International Joint Conferences on Artificial Intelligence.All right reserved. 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. We show that 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. An experimental study establishes up to what parameter values the dynamic programs can determine optimal solutions in a couple of minutes.

Full Text

Duke Authors

Cited Authors

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

Published Date

  • January 1, 2018

Published In

Volume / Issue

  • 2018-July /

Start / End Page

  • 4736 - 4742

International Standard Serial Number (ISSN)

  • 1045-0823

International Standard Book Number 13 (ISBN-13)

  • 9780999241127

Digital Object Identifier (DOI)

  • 10.24963/ijcai.2018/658

Citation Source

  • Scopus