Optimal Reconfiguration of DC Networks


Altun T., Madani R., Yadav A. P., Nasir A., Davoudi A.

IEEE TRANSACTIONS ON POWER SYSTEMS, cilt.35, sa.6, ss.4272-4284, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 6
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1109/tpwrs.2020.2994962
  • Dergi Adı: IEEE TRANSACTIONS ON POWER SYSTEMS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.4272-4284
  • Anahtar Kelimeler: Programming, Matrices, Switches, Economics, Network topology, Matrix converters, DC network, economic dispatch, load shedding, network reconfiguration, optimal power flow, OPTIMAL POWER-FLOW, VALID INEQUALITIES, CONVEX RELAXATION, SDP RELAXATION, MANAGEMENT
  • Yozgat Bozok Üniversitesi Adresli: Hayır

Özet

In this paper, we consider the problem of optimizing voltage set points and switching status of components in direct current power networks subject to physical and security constraints. The problem is cast as a mixed-integer nonlinear programming with two sources of computational complexity: i) Non-convex power flow equations, and ii) The presence of binary variables accounting for the on/off status of network components. A strengthened second-order cone programming (SOCP) relaxation is developed to tackle the non-convexity of power flow equations, and a branch-and-bound search is employed for determining optimal network configurations. The efficacy of the proposed method in optimizing the operation while mitigating contingencies is experimentally validated in a real-time hardware-in-the-loop environment using IEEE benchmark data.