All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Robust Distributed Algorithm for Solving the Economic Dispatch Problem with the Penetration of Renewables and Battery Systems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F24%3A43971635" target="_blank" >RIV/49777513:23520/24:43971635 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.mdpi.com/2076-3417/14/5/1991" target="_blank" >https://www.mdpi.com/2076-3417/14/5/1991</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/app14051991" target="_blank" >10.3390/app14051991</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Robust Distributed Algorithm for Solving the Economic Dispatch Problem with the Penetration of Renewables and Battery Systems

  • Original language description

    In the field of energy networks, for their effective functioning, it is necessary to distribute the required load between all online generating units in a proper way to cover the demand. The load schedule is obtained by solving the so-called Economic Dispatch Problem (EDP). The EDP can be solved in many ways, resulting in a power distribution plan between online generating units in the network so that the resulting price per unit of energy is minimal. This article focuses on designing a distributed gradient algorithm for solving EDP, supplemented by models of renewable sources, Battery Energy Storage System (BESS), variable fuel prices, and consideration of multiple uncertainties at once. Specifically, these are: time-variable transport delays, noisy gradient calculation, line losses, and drop-off packet representations. The algorithm can thus be denoted as robust, which can work even in unfavorable conditions commonly found in real applications. The capabilities of the presented algorithm will be demonstrated and evaluated on six examples.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20205 - Automation and control systems

Result continuities

  • Project

    <a href="/en/project/9A22007" target="_blank" >9A22007: Optimization of Electric Vehicle Autonomy</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Applied Sciences

  • ISSN

    2076-3417

  • e-ISSN

    2076-3417

  • Volume of the periodical

    14

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    41

  • Pages from-to

  • UT code for WoS article

    001182888000001

  • EID of the result in the Scopus database

    2-s2.0-85192497448