Optimal Day-Ahead Scheduling in AC/DC Hybrid Distribution Networks based on SOCP

DC distribution systems, which can improve the accommodation of renewable energy sources and DC loads, have developed rapidly, leading to the appearance of hybrid AC/DC distribution systems. This paper proposes an optimal day-ahead scheduling model to increase the economy of the system operation con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2019 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC) s. 1 - 5
Hlavní autoři: Sun, Wei, Zhang, Wen, Zhang, Tingting, Du, Yaxin
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2019
Témata:
Active-reactive power combined optimal dispatch
conservation voltage reduction
Distribution networks
hybrid AC/DC distribution networks
Induction motors
Load modeling
Mathematical model
Reactive power
Renewable energy sources
second-order cone programming
Static VAr compensators
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í:DC distribution systems, which can improve the accommodation of renewable energy sources and DC loads, have developed rapidly, leading to the appearance of hybrid AC/DC distribution systems. This paper proposes an optimal day-ahead scheduling model to increase the economy of the system operation considering the high penetration and uncertainty of the distributed generations. The proposed model aims to minimize the active power loss and electricity purchasing cost by coordinating active or reactive power outputs of voltage source converter (VSC), energy storage system (ESS) and static var compensation (SVC), as well as the voltage regulation capability of OLTC. Besides, the load model has been carefully analysed to implement conservation voltage reduction (CVR). In addition, VSC is detailed modelled to capture the coupling between active power and reactive power. Moreover, the second-order cone programming (SOCP) is used in this paper to transform the mixed integer nonlinear programming problem to a convex optimization one, which shortens the solving time. The IEEE 33-bus test system is employed to demonstrate the effectiveness and efficiency of the proposed method.
DOI:10.1109/APPEEC45492.2019.8994465