TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities
 
Options

Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities

Citation Link: https://doi.org/10.15480/882.13195
Publikationstyp
Conference Paper
Date Issued
2024
Sprache
English
Author(s)
Codazzi, Laura  
Algorithmen und Komplexität E-11  
Csáji, Gergely  
Mnich, Matthias  orcid-logo
Algorithmen und Komplexität E-11  
TORE-DOI
10.15480/882.13195
TORE-URI
https://hdl.handle.net/11420/48631
Citation
International Joint Conference on Artificial Intelligence (IJCAI 2024)
Contribution to Conference
International Joint Conference on Artificial Intelligence (IJCAI 2024)
Publisher DOI
10.24963/ijcai.2024/207
Scopus ID
2-s2.0-85204304725
Publisher
IJCAI
ISBN
978-1-956792-04-1
We introduce and study various models of how prosumers in a microgrid can satisfy their demands of electrical energy while minimizing their costs over fixed time horizon. Prosumers have individual demands, which can vary
ay-by-day, and which they can satisfy by either consuming selfgenerating electrical energy locally (e.g., from operating PV panels) or from acquiring energy from other prosumers in the same microgrid.
Our models take into account two key aspects motivated by real-life scenarios: first, we consider a daily volatility of prices for buying and selling energy, and second, the possibility to store the selfgenerated
energy in a battery of finite capacity to be either self-consumed or sold to other prosumers in the future. We provide a thorough complexity analysis, as well as efficient algorithms, so that prosumers can minimize their overall cost over the entire time horizon. As a byproduct, we also solve a new temporal version of the classical KNAPSACK problem, which may be of independent interest. We complement our theoretical findings by extensive experimental evaluations on realistic data sets.
Subjects
Constraint Satisfaction and Optimization
Planning and Scheduling
Planning and Scheduling
Planning and Scheduling
DDC Class
510: Mathematics
Publication version
publishedVersion
Lizenz
https://creativecommons.org/licenses/by/4.0/
Loading...
Thumbnail Image
Name

ijcai.pdf

Size

323.62 KB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback