Complexity of Scheduling Charging in the Smart Grid

Conference paper (2018)

Authors

M.M. de Weerdt Algorithmics - EEMCS
Michael Albert Duke University
V Conitzer Duke University
J.G.M. van der Linden Algorithmics - EEMCS
Research Group
Algorithmics (EEMCS) (TU Delft)
Copyright: © 2018 M.M. de Weerdt, Michael Albert, Vincent Conitzer, J.G.M. van der Linden
DOI
help_outline
https://doi.org/10.24963/ijcai.2018/658
More Info
expand_more

Published Date

13-07-2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Algorithmics

Abstract

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.

Files

0658.pdf
(.pdf | 1.77 Mb)
Main.pdf
(.pdf | 0.383 Mb)