Documents

Links

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.
Original languageEnglish
Title of host publicationProceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018)
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1924-1926
Number of pages3
ISBN (Electronic)978-1-4503-5649-7
Publication statusPublished - 2018
Event17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 - Stockholm, Sweden
Duration: 10 Jul 201815 Jul 2018

Conference

Conference17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
CountrySweden
CityStockholm
Period10/07/1815/07/18

    Research areas

  • Complexity Theory, Scheduling, Charging Electric Vehicles

ID: 45105205