Projects per year
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.
|Title of host publication||Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018)|
|Publisher||International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)|
|Number of pages||3|
|Publication status||Published - 2018|
|Event||17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 - Stockholm, Sweden|
Duration: 10 Jul 2018 → 15 Jul 2018
|Conference||17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018|
|Period||10/07/18 → 15/07/18|
Bibliographical noteGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
- Complexity Theory
- Charging Electric Vehicles
FingerprintDive into the research topics of 'Complexity of Scheduling Charging in the Smart Grid: Extended Abstract'. Together they form a unique fingerprint.
- 1 Finished
1/02/17 → 15/09/19