Optimization of Charging Strategies for Electric Vehicles in PowerMatcher-Driven Smart Energy Grids
Autor: | Kempker, Pia, van Dijk, N.M., Scheinhardt, Willem R.W., van den Berg, Hans Leo, Hurink, Johann L., Knottenbelt, W., Wolter, K., Busic, A., Gribaudo, M., Reinecke, P. |
---|---|
Přispěvatelé: | Stochastic Operations Research, Discrete Mathematics and Mathematical Programming |
Rok vydání: | 2016 |
Předmět: |
Flexibility (engineering)
Mathematical optimization Electric vehicles Computer science business.industry 020209 energy 02 engineering and technology Bidding EWI-26827 Smart Grids Stochastic programming Supply and demand IR-99668 Market-based coordination Smart grid Distributed generation PowerMatcher Stochastic dynamic programming Dynamic pricing 0202 electrical engineering electronic engineering information engineering Performance improvement METIS-316836 business |
Zdroj: | Proceedings 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Valuetools 2015, 1-8 STARTPAGE=1;ENDPAGE=8;TITLE=Proceedings 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Valuetools 2015 |
DOI: | 10.4108/eai.4-1-2016.151091 |
Popis: | A crucial challenge in future smart energy grids is the large-scale coordination of distributed energy demand and generation. The well-known PowerMatcher is a promising approach that integrates demand and supply flexibility in the operation of the electricity system through dynamic pricing and a hierarchical bidding coordination scheme. However, as the PowerMatcher focuses on short-term coordination of demand and supply, it cannot fully exploit the flexibility of e.g. electric vehicles over longer periods of time. In this paper, we propose an extension of the PowerMatcher comprising a planning module, which provides coordinated predictions of demand/price over longer times as input to the users for determining their short-term bids. The optimal short-term bidding strategy minimizing a user's costs is then formulated as a Stochastic Dynamic Programming (SDP) problem. We derive an analytic solution for this SDP problem leading to a simple short-term bidding strategy. Numerical results using real-world data show a substantial performance improvement compared to the standard PowerMatcher, without significant additional complexity. |
Databáze: | OpenAIRE |
Externí odkaz: |