本文關鍵詞：非支配點排序算法在電力系統(tǒng)多目標優(yōu)化中的應用　出處：《武漢大學》2017年碩士論文　論文類型：學位論文

  更多相關文章： 多目標優(yōu)化 非支配點排序算法 輸電線路狀態(tài)檢修 無功優(yōu)化調(diào)度 元啟發(fā)式算法

【摘要】：隨著我國電力行業(yè)的發(fā)展,計算機運算能力不斷提高,在電力系統(tǒng)規(guī)劃問題中對經(jīng)濟性、安全性、可靠性等多目標的兼顧平衡需求日益加強,當今流行的元啟發(fā)式算法在求解電力系統(tǒng)中帶高維非線性約束的整數(shù)規(guī)劃或混合整數(shù)規(guī)劃類型的多目標優(yōu)化問題時存在著參數(shù)選擇主觀性強、解集收斂精度低的問題。因此,依據(jù)電力系統(tǒng)輸電線路狀態(tài)檢修計劃模型的檢修時段自變量為整數(shù)及電力系統(tǒng)無功優(yōu)化調(diào)度的自變量中同時包含離散與連續(xù)變量,結(jié)合這兩個場景包含的高維非線性約束條件,進而提出非支配點排序算法用于求解模型,實現(xiàn)經(jīng)濟性、可靠性相較元啟發(fā)式算法更優(yōu)的檢修計劃及有功損失更小、電壓更穩(wěn)定的電力系統(tǒng)無功優(yōu)化調(diào)度方案。論文首先介紹了多目標優(yōu)化的基本理論,包括多目標優(yōu)化的基本定義、優(yōu)化目標及性能指標函數(shù),在此基礎上闡述了多目標優(yōu)化問題的傳統(tǒng)解法與元啟發(fā)式解法,并對這些算法的優(yōu)缺點進行了研究,為非支配點排序算法的提出提供了理論依據(jù)。隨后闡述了快速非支配排序機制,基于此機制及多目標優(yōu)化概念提出了非支配點排序算法并介紹了算法的基本思路及求解多目標優(yōu)化問題的具體流程。通過對相關多目標優(yōu)化測試函數(shù)的仿真結(jié)果對比,證實了非支配點排序算法與元啟發(fā)式算法相比在計算效率、解集收斂性及求解非連續(xù)可行域問題時的優(yōu)越性。最后將非支配點排序算法應用于輸電線路狀態(tài)檢修計劃多目標優(yōu)化模型、將非支配點排序算法與花授粉算法結(jié)合應用于電力系統(tǒng)無功優(yōu)化調(diào)度,通過實例分析驗證了本文所提出的求解方法是正確、有效的。同時,與經(jīng)典的元啟發(fā)式算法的對比結(jié)果對比進一步說明了本文算法的合理性,為電力系統(tǒng)的多目標優(yōu)化問題的求解提供了一種新的可靠方案。
[Abstract]:With the development of the electric power industry in our country, the computer computing ability has been improved constantly, and the balance demand of economy, security, reliability and other multi-objective in the power system planning has been strengthened day by day. Nowadays, the popular meta-heuristic algorithm has a strong subjectivity of parameter selection in solving multi-objective optimization problems with high-dimensional nonlinear constraints or mixed integer programming types in power systems. The problem of low convergence accuracy of solution sets. According to the power transmission line condition maintenance plan model, the independent variable of maintenance period is integer and the independent variable of reactive power optimal dispatching includes discrete and continuous variables. Combined with the high dimensional nonlinear constraints of these two scenarios, an undominated point sorting algorithm is proposed to solve the model and realize the economy. Compared with the meta-heuristic algorithm, the reliability is better than the meta-heuristic algorithm for the optimal scheduling of reactive power in power system with less loss of active power and more stable voltage. Firstly, the basic theory of multi-objective optimization is introduced in this paper. It includes the basic definition of multi-objective optimization, optimization objective and performance index function. On this basis, the traditional solution and meta-heuristic method of multi-objective optimization problem are expounded, and the advantages and disadvantages of these algorithms are studied. It provides a theoretical basis for the proposed non-dominated point sorting algorithm, and then describes the rapid non-dominated sorting mechanism. Based on this mechanism and the concept of multi-objective optimization, the non-dominated point sorting algorithm is proposed, and the basic idea of the algorithm and the concrete flow chart for solving the multi-objective optimization problem are introduced. The simulation results of relevant multi-objective optimization test function are given. Contrast. Compared with the meta-heuristic algorithm, the computational efficiency of the non-dominated point sorting algorithm is verified. The convergence of the solution set and the superiority of solving the discontinuous feasible region problem. Finally, the non-dominated point sorting algorithm is applied to the multi-objective optimization model of the transmission line condition maintenance plan. The non-dominated point sorting algorithm and the pollination algorithm are applied to the reactive power optimal scheduling of power system. The example analysis proves that the proposed method is correct and effective. At the same time. The comparison of the results with the classical meta-heuristic algorithm further proves the rationality of the proposed algorithm and provides a new reliable scheme for solving multi-objective optimization problems in power systems.
【學位授予單位】：武漢大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TM73

【參考文獻】

相關期刊論文 前10條

1 文志強;舒乃秋;彭輝;蔡德華;聞建中;;輸電線路差異化運維計劃優(yōu)化[J];電網(wǎng)技術;2015年04期

2 劉文穎;謝昶;文晶;王佳明;王維洲;;基于小生境多目標粒子群算法的輸電網(wǎng)檢修計劃優(yōu)化[J];中國電機工程學報;2013年04期

3 于宏濤;高立群;李麗霞;;基于蟻群算法輸電線路檢修計劃的制定[J];計算機應用研究;2011年09期

4 劉桂龍;王維慶;張新燕;蔡靜靜;;無功優(yōu)化算法綜述[J];電力學報;2010年05期

5 許旭鋒;黃民翔;王婷婷;陳興雷;;供電設備檢修優(yōu)化算法及其在地區(qū)電網(wǎng)中的應用[J];電網(wǎng)技術;2009年14期

6 許旭鋒;黃民翔;王婷婷;邱家駒;;基于機會約束2層規(guī)劃的輸電線路檢修計劃優(yōu)化[J];電力系統(tǒng)自動化;2009年02期

7 束洪春;胡澤江;謝一工;;計及隱性損失的輸電線路檢修計劃優(yōu)化方法[J];電力系統(tǒng)自動化;2008年09期

8 張步涵;楊超;陶芬;;基于兩層遺傳算法的多時段無功優(yōu)化方法[J];電力自動化設備;2008年03期

9 劉永梅;盛萬興;;基于網(wǎng)絡拓撲和遺傳算法的配電設備檢修計劃優(yōu)化模型[J];電網(wǎng)技術;2007年21期

10 郭云鵬;黃民翔;許旭鋒;;輸變電設備的檢修策略[J];華東電力;2006年12期

，

本文編號：1406316