本文選題：主動解列　切入點：NP難題　出處：《電網(wǎng)技術》2015年01期 　論文類型：期刊論文

【摘要】：主動解列最優(yōu)斷面搜索是依據(jù)廣域測量信息,在大電網(wǎng)遭受大擾動失步崩潰之前,依據(jù)實時工況和運行方式,快速準確求取電力孤島劃分的緊急策略。然而,在實際大系統(tǒng)的求解中,計算復雜度呈幾何指數(shù)增長,是一個NP難題。提出了一種半監(jiān)督譜聚類算法,首先采用最小復合有功潮流沖擊的目標函數(shù)和機組同調(diào)/分離等相關約束構建詳細解列斷面搜索模型,然后將最優(yōu)斷面搜索的優(yōu)化求解過程,映射為約束譜聚類對靜態(tài)圖分割的松弛解求取過程,最后通過改進的PAM聚類算法選擇最優(yōu)主動解列斷面。上述過程,在不丟失全網(wǎng)信息前提下,降低了時間復雜度,IEEE 118標準算例和四川電網(wǎng)實際系統(tǒng)的仿真驗證,證明了該算法的正確性、有效性和快速性。
[Abstract]:The optimal cross-section search for active decoupling is based on wide-area measurement information, and the emergency strategy of power island division is obtained quickly and accurately according to real-time working conditions and operation mode before large power grid suffers from large disturbance and collapse. In the real large-scale system, the computational complexity increases exponentially, which is a NP problem. A semi-supervised spectral clustering algorithm is proposed. Firstly, using the objective function of the minimum complex active power flow impact and the related constraints such as unit homology / separation, the detailed dissolving section search model is constructed, and then the optimization process of the optimal section search is put forward. The mapping is the relaxed solution of static graph segmentation by constrained spectral clustering. Finally, the optimal active disassembly section is selected by the improved PAM clustering algorithm. The time complexity of IEEE 118 standard is reduced and the simulation results of Sichuan power system are given. The correctness, validity and rapidity of the proposed algorithm are proved.
【作者單位】： 武漢大學電氣工程學院;淮安供電公司;國電南瑞科技股份有限公司;
【基金】：中央高校基本科研業(yè)務費專項資金資助 博士后科學基金(2014M552080)~~
【分類號】：TM73

【相似文獻】

相關期刊論文 前10條

1 胥威汀;劉俊勇;李e，

本文編號：1574075