A gossip-based asynchronous distributed algorithm for economic dispatch problem with transmission losses

Considering the transmission losses of power, this paper proposes a gossip-based distributed algorithm to solve the economic dispatch problem in smart grids. Unlike the existing works, two contributions are introduced. The supply-demand constraint of the economic dispatch problem includes transmissi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Innovative Smart Grid Technologies--Asia s. 770 - 775
Hlavní autoři: Wang, Rui, Li, Qiqiang, Shi, Yang, Wang, Luhao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2019
Témata:
Communication networks
consensus
Convergence
Distributed algorithm
Distributed algorithms
economic dispatch problem
Economics
Generators
Propagation losses
smart grid
Smart grids
transmission losses
ISSN:2378-8542
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Considering the transmission losses of power, this paper proposes a gossip-based distributed algorithm to solve the economic dispatch problem in smart grids. Unlike the existing works, two contributions are introduced. The supply-demand constraint of the economic dispatch problem includes transmission losses. The amount of transmission losses induced by each generator can be represented as a quadratic function, which introduces nonlinear constraints in the economic dispatch problem. However, the existing algorithms do not handle this issue. On the other hand, the proposed algorithm is based on gossip algorithm, which implies that only two nodes are activated randomly to exchange their information at each time slot. Therefore, the algorithm does not need to simultaneously delivery information between all nodes, which will increase the risk of information congestion and the computing burden of controllers. Simulation results illustrate that the convergence of the algorithm and compared with the centralized algorithm, the effectiveness of the algorithm is shown.
ISSN:2378-8542
DOI:10.1109/ISGT-Asia.2019.8881641