TY - JOUR
T1 - Mixed-Integer Linear Programming-Based Splitting Strategies for Power System Islanding Operation Considering Network Connectivity
AU - Ding, Tao
AU - Sun, Kai
AU - Huang, Can
AU - Bie, Zhaohong
AU - Li, Fangxing
N1 - Publisher Copyright:
© 2012 IEEE.
PY - 2018/3
Y1 - 2018/3
N2 - An efficient splitting strategy is important for the islanding operation of power systems. In this paper, a mixed-integer linear programming (MILP)-based splitting method is proposed. First, the graph theory is employed to transform the splitting problem into a graph partition problem. Then, the graph partition problem is modeled as an MILP optimization problem with consideration to the network connectivity of all subgraphs. The MILP-based splitting strategy can be efficiently computed with existing commercial solvers, and the multiple optimal solutions can be captured with the recursive process. Compared with the splitting methods in the literature, the proposed method is more flexible and efficient, such that the users can select the optimal solution from multiple solutions with different interests and heuristic splitting rules (e.g., with the minimum amount of switched lines). Finally, the effectiveness of the proposed method has been verified with IEEE 30-, 118-, and 300-bus test systems.
AB - An efficient splitting strategy is important for the islanding operation of power systems. In this paper, a mixed-integer linear programming (MILP)-based splitting method is proposed. First, the graph theory is employed to transform the splitting problem into a graph partition problem. Then, the graph partition problem is modeled as an MILP optimization problem with consideration to the network connectivity of all subgraphs. The MILP-based splitting strategy can be efficiently computed with existing commercial solvers, and the multiple optimal solutions can be captured with the recursive process. Compared with the splitting methods in the literature, the proposed method is more flexible and efficient, such that the users can select the optimal solution from multiple solutions with different interests and heuristic splitting rules (e.g., with the minimum amount of switched lines). Finally, the effectiveness of the proposed method has been verified with IEEE 30-, 118-, and 300-bus test systems.
KW - Graph theory
KW - mixed-integer linear programming (MILP)
KW - multiple optimal solutions (MOSs)
KW - network connectivity
KW - partition problem
KW - system splitting
UR - https://www.scopus.com/pages/publications/84979534757
U2 - 10.1109/JSYST.2015.2493880
DO - 10.1109/JSYST.2015.2493880
M3 - 文章
AN - SCOPUS:84979534757
SN - 1932-8184
VL - 12
SP - 350
EP - 359
JO - IEEE Systems Journal
JF - IEEE Systems Journal
IS - 1
ER -