Study on a Fast Controlled Partition Scheme Based on Improved Dinic Max-flow Strategy

被引:0
|
作者
Tang, Fei [1 ]
Jia, Jun [1 ]
Wang, Bo [1 ]
Liao, Qingfen [1 ]
Wang, Jing [1 ]
Zhu, Zheng [1 ]
Liu, Yu [2 ]
机构
[1] Wuhan Univ, Dept Elect Engn, Wuhan 430072, Peoples R China
[2] South Cent Univ Nationalities, Sch Foreign Languages, Wuhan, Peoples R China
关键词
controlled islanding; NP problem; Dinic Max-flow; optimal partition sections; POWER-FLOW;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
When power system is subjected to severe disturbances and then will be out of step. The interconnected power grid should be split into several islands to avoid blackout. The controlled islanding is an active control technique based on the information from Wide Area Measurement System (WAMS) to accomplish the islanding task. This paper proposes a fast islanding strategy for large power networks. Firstly, the grid structure is mapped to point sets and edge sets in the graph theory. Secondly, the model is built by adopting the minimum power flow impact as the objective function and considering several constraints which includes generator coherency constraint and connective constraint. Finally, the optimal splitting strategy is searched by the improved Dinic maximum flow algorithm. Simulation results on IEEE 118-bus power system show that the proposed strategy is correct, effective and fast.
引用
收藏
页数:5
相关论文
共 50 条
  • [21] Statistical-Based Segmentation of Bone Structures via Continuous Max-Flow Optimization
    Perez Carrasco, Jose-Antonio
    Serrano-Gotarredona, Carmen
    Suarez-Mejias, Cristina
    Acha-Pinero, Begona
    IMAGE ANALYSIS AND RECOGNITION, ICIAR 2014, PT II, 2014, 8815 : 201 - 208
  • [22] IMPROVED BOUNDS FOR THE MAX-FLOW MIN-MULTICUT RATIO FOR PLANAR AND K(R,R)-FREE GRAPHS
    TARDOS, E
    VAZIRANI, VV
    INFORMATION PROCESSING LETTERS, 1993, 47 (02) : 77 - 80
  • [23] Patch-based texture synthesis via min-cut/max-flow algorithms
    Wu Bo
    Wang Yan
    Liu Xiao-Yun
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 219 - 222
  • [24] A Fast Hierarchical Clustering Approach Based on Partition and Merging Scheme
    Zhang, Yiqun
    Cheung, Yiu-ming
    PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2018, : 846 - 851
  • [25] Temporal Graph based Energy-limited Max-flow Routing over Satellite Networks
    Shi, Keyi
    Li, Hongyan
    Suo, Long
    2021 IFIP NETWORKING CONFERENCE AND WORKSHOPS (IFIP NETWORKING), 2021,
  • [26] Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network
    Otsuki, Kensuke
    Kobayashi, Yusuke
    Murota, Kazuo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 248 (02) : 396 - 403
  • [27] Image Segmentation Based on Local Chan-Vese Model Optimized by Max-flow Algorithm
    Li, Zhongguo
    Zeng, Lei
    Wang, Ti
    Chen, Jian
    Yan, Bin
    2016 17TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2016, : 213 - 217
  • [28] Fast CU partition strategy for HEVC based on Haar wavelet
    Sun, Xuebin
    Chen, Xiaodong
    Xu, Yong
    Wang, Yi
    Yu, Daoyin
    IET IMAGE PROCESSING, 2017, 11 (09) : 717 - 723
  • [29] MPLS traffic engineering using enhanced minimum interference routing: An approach based on lexicographic max-flow
    Kar, K
    Kodialam, M
    Lakshman, TV
    IEEE 2000 EIGHTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, 2000, : 105 - 114
  • [30] Segmentation of Bone Structures in 3D CT Images Based on Continuous Max-flow Optimization
    Perez-Carrasco, J. A.
    Acha, B.
    Serrano, C.
    MEDICAL IMAGING 2015: IMAGE PROCESSING, 2015, 9413