基于圖解螞蟻系統(tǒng)算法的城市配電網(wǎng)重構(gòu)與故障恢復(fù)綜合方法研究
本文選題:城市配電網(wǎng) + 靜態(tài)重構(gòu) ; 參考:《武漢大學(xué)》2014年博士論文
【摘要】:配電網(wǎng)重構(gòu)和故障恢復(fù)通過(guò)改變配電網(wǎng)中分段開(kāi)關(guān)和聯(lián)絡(luò)開(kāi)關(guān)的開(kāi)/合狀態(tài)來(lái)改變配電網(wǎng)的運(yùn)行狀況,以減少負(fù)荷損失,提高運(yùn)行的經(jīng)濟(jì)性,是配電網(wǎng)優(yōu)化的有效手段。與僅含饋線的小型配電網(wǎng)相比,包含多個(gè)電壓等級(jí)以及配電變壓器和饋線的城市配電網(wǎng)的優(yōu)化潛力更大,配電變壓器等元件的備用容量更大,配電網(wǎng)故障后能夠恢復(fù)的負(fù)荷更多,因此有必要研究城市配電網(wǎng)的重構(gòu)與故障恢復(fù)問(wèn)題。 針對(duì)城市配電網(wǎng)元件數(shù)量多、可行解解集大的特點(diǎn),提出了一種采用圖解螞蟻系統(tǒng)算法求解城市配電網(wǎng)重構(gòu)與故障恢復(fù)問(wèn)題的方法。求解過(guò)程分為離線和在線兩個(gè)階段。離線階段對(duì)配電網(wǎng)進(jìn)行拓?fù)浞治?用構(gòu)造圖表示可行解解集。故障恢復(fù)問(wèn)題的構(gòu)造圖由重構(gòu)問(wèn)題的構(gòu)造圖經(jīng)過(guò)簡(jiǎn)單的修改得到。不同元件發(fā)生故障時(shí),采用不同方法修改重構(gòu)問(wèn)題構(gòu)造圖。在線階段通過(guò)模擬蟻群在構(gòu)造圖中的旅行過(guò)程進(jìn)行搜索尋優(yōu)。 構(gòu)造圖僅與配電網(wǎng)的拓?fù)浣Y(jié)構(gòu)有關(guān),與配電網(wǎng)的負(fù)荷狀態(tài)無(wú)關(guān),因此配電網(wǎng)的拓?fù)浣Y(jié)構(gòu)一旦確定,即可建立構(gòu)造圖。重構(gòu)和故障恢復(fù)問(wèn)題的求解與配電網(wǎng)的負(fù)荷狀態(tài)有關(guān)。求解重構(gòu)和故障恢復(fù)問(wèn)題時(shí)無(wú)需重新建立構(gòu)造圖,僅執(zhí)行在線階段即可。 提出了一種新的拓?fù)浞治龇椒。在離線階段,該方法利用饋線上的每個(gè)節(jié)點(diǎn)必須找到唯一電源向其供電的特點(diǎn)完成拓?fù)浞治?形成不含冗余的重構(gòu)問(wèn)題可行解解集,用構(gòu)造圖表示,從而方便在線階段用圖解螞蟻系統(tǒng)算法完成搜索尋優(yōu)。構(gòu)造圖在計(jì)算機(jī)中以鏈表形式存儲(chǔ),使搜索尋優(yōu)過(guò)程無(wú)需進(jìn)行復(fù)雜計(jì)算。 與傳統(tǒng)方法不同,由于本文方法拓?fù)浞治鼋Y(jié)果中包含饋線上不同電源(即配電變壓器低壓母線)信息,因此通過(guò)簡(jiǎn)單修改重構(gòu)問(wèn)題構(gòu)造圖,即可得到故障恢復(fù)問(wèn)題構(gòu)造圖,也就是故障恢復(fù)問(wèn)題的拓?fù)浣Y(jié)構(gòu)可行解解集。根據(jù)故障元件的不同,本文提出了兩種修改重構(gòu)問(wèn)題構(gòu)造圖的方法,包括限制路徑方法和增加附加構(gòu)造圖方法,可以處理包括饋線、配電變壓器等不同種類元件、多重故障情況下的故障恢復(fù)問(wèn)題。 配電網(wǎng)動(dòng)態(tài)重構(gòu)中需要同時(shí)求解各時(shí)段的拓?fù)浣Y(jié)構(gòu)及時(shí)段長(zhǎng)度,二者之間的耦合關(guān)系非常復(fù)雜。為了避免二者的不當(dāng)解耦,在城市配電網(wǎng)靜態(tài)重構(gòu)問(wèn)題構(gòu)造圖的基礎(chǔ)上,加入表示時(shí)段長(zhǎng)度的部分,形成城市配電網(wǎng)動(dòng)態(tài)重構(gòu)問(wèn)題構(gòu)造圖。由于每個(gè)時(shí)段的拓?fù)浣Y(jié)構(gòu)可行解解集是相同的,因此該方法避免了反復(fù)進(jìn)行拓?fù)浞治。針?duì)城市配電網(wǎng)動(dòng)態(tài)重構(gòu)問(wèn)題解集規(guī)模大、難以求解的特點(diǎn),提出了一種縮小搜索范圍的方法。該方法將相鄰時(shí)段的拓?fù)浣Y(jié)構(gòu)互換,并相互比較,進(jìn)而在不大幅增加開(kāi)關(guān)操作次數(shù)的前提下得到更優(yōu)解。利用該方法,搜索范圍由可行解解集轉(zhuǎn)換為較優(yōu)解解集,從而減少了計(jì)算量,提高了優(yōu)化質(zhì)量。 修改了傳統(tǒng)蟻群算法中的選邊規(guī)則和信息素更新規(guī)則,將參數(shù)α由大于1的恒定值修改為隨迭代次數(shù)按指數(shù)增加的變化值,并忽略參數(shù)β、η和ρ,使迭代前期進(jìn)行隨機(jī)搜索,迭代后期進(jìn)行重點(diǎn)搜索,從而使算法適用于城市配電網(wǎng)的重構(gòu)和故障恢復(fù)問(wèn)題等大規(guī)模離散變量?jī)?yōu)化問(wèn)題的求解,避免算法陷入局部最優(yōu)。 以一個(gè)實(shí)際的城市配電網(wǎng)作為研究對(duì)象,分別進(jìn)行靜態(tài)重構(gòu)問(wèn)題、動(dòng)態(tài)重構(gòu)問(wèn)題以及不同元件的多重故障恢復(fù)問(wèn)題的仿真計(jì)算。計(jì)算結(jié)果表明,本文方法可以有效降低城市配電網(wǎng)的網(wǎng)損,減少負(fù)荷損失,優(yōu)化配電網(wǎng)的運(yùn)行狀況。
[Abstract]:The distribution network reconfiguration and fault recovery changes the operating conditions of the distribution network by changing the open / close state of the segment switch and the contact switch in the distribution network , so as to reduce the load loss , improve the economy of operation , and is an effective means for optimizing the distribution network .
This paper presents a method for solving the problem of reconfiguration and fault restoration of urban distribution network by using the illustrated ant system algorithm for the large number of urban distribution network elements . The solving process is divided into two stages : off - line and on - line .
The structural diagram is only related to the topological structure of the distribution network , which is independent of the load state of the distribution network , so the topological structure of the distribution network can be established once the topological structure of the distribution network is determined .
This paper presents a new topology analysis method . In the off - line phase , the method makes use of each node on the feeder to complete the topology analysis of the characteristics of its power supply to form a feasible solution set with no redundancy .
Different from the traditional method , because of the information of different power supply ( i.e . , low voltage busbar of distribution transformer ) on the feeder line in the topological analysis result of the method , the fault recovery problem structure diagram can be obtained by simply modifying the reconstruction problem structure diagram . According to the difference of the fault elements , two methods of modifying the reconstruction problem structure diagram are put forward , including the limitation of the path method and the addition of the additional structure diagram method , which can deal with the problem of fault recovery under the condition of multiple faults , such as feeders , distribution transformers and the like .
In order to avoid the improper decoupling of the two , it is difficult to solve the problem of dynamic reconfiguration of urban distribution network .
The selection rule and pheromone updating rule in the traditional ant colony algorithm are modified , and the parameter 偽 is modified by a constant value greater than 1 as the change value which is increased exponentially with the number of iterations , and the parameter 尾 , 畏 and 蟻 are ignored , so that the iterative early stage is subjected to random search and the later stage of iteration is focused search , so that the algorithm is suitable for solving the optimization problem of large - scale discrete variables such as reconstruction of the urban distribution network and fault restoration , and the algorithm is avoided into local optimal .
Taking an actual urban distribution network as the research object , the static reconstruction problem , the dynamic reconfiguration problem and the simulation calculation of multiple fault recovery problems of different elements are carried out respectively . The calculation results show that the method can effectively reduce the network loss of the urban distribution network , reduce the load loss and optimize the operating conditions of the distribution network .
【學(xué)位授予單位】:武漢大學(xué)
【學(xué)位級(jí)別】:博士
【學(xué)位授予年份】:2014
【分類號(hào)】:TM727.2
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 張棟;張劉春;傅正財(cái);;基于改進(jìn)禁忌算法的配電網(wǎng)絡(luò)重構(gòu)[J];電工技術(shù)學(xué)報(bào);2005年11期
2 張雅;楊麗徙;劉冬;張玉珠;;基于蟻群算法的配電網(wǎng)故障后恢復(fù)重構(gòu)[J];電氣應(yīng)用;2007年09期
3 韓禎祥,文福栓;人工神經(jīng)元網(wǎng)絡(luò)在電力系統(tǒng)中應(yīng)用的新進(jìn)展(一)[J];電力系統(tǒng)自動(dòng)化;1993年01期
4 李海鋒,張堯,錢國(guó)基,黃健;配電網(wǎng)故障恢復(fù)重構(gòu)算法研究[J];電力系統(tǒng)自動(dòng)化;2001年08期
5 劉健;石曉軍;程紅麗;徐精求;;配電網(wǎng)大面積斷電供電恢復(fù)及開(kāi)關(guān)操作順序生成[J];電力系統(tǒng)自動(dòng)化;2008年02期
6 何禹清;劉定國(guó);曾超;文明;;計(jì)及可靠性的配電網(wǎng)重構(gòu)模型及其分階段算法[J];電力系統(tǒng)自動(dòng)化;2011年17期
7 楊麗君;劉建超;曹良晶;盧志剛;;基于黑板模型的配電網(wǎng)故障恢復(fù)多代理協(xié)作機(jī)制設(shè)計(jì)[J];電力系統(tǒng)自動(dòng)化;2012年06期
8 張利民;馬強(qiáng);李振坤;劉皓明;;基于禁忌克隆遺傳算法的配電網(wǎng)故障恢復(fù)重構(gòu)[J];電力系統(tǒng)及其自動(dòng)化學(xué)報(bào);2010年01期
9 余貽鑫,邱煒,劉若沁;基于啟發(fā)式算法與遺傳算法的配電網(wǎng)重構(gòu)[J];電網(wǎng)技術(shù);2001年11期
10 張鋒,江道灼,張怡;基于變結(jié)構(gòu)耗散網(wǎng)絡(luò)的特殊配電網(wǎng)接線故障恢復(fù)的改進(jìn)算法[J];電網(wǎng)技術(shù);2003年04期
相關(guān)碩士學(xué)位論文 前3條
1 宋剛;基于粒子群和差分進(jìn)化算法的新型混合算法在配電網(wǎng)重構(gòu)中的應(yīng)用[D];浙江大學(xué);2008年
2 施玲君;基于可拓蟻群算法的配電網(wǎng)重構(gòu)研究[D];南京理工大學(xué);2009年
3 黃哲;基于改進(jìn)和聲搜索算法的配電網(wǎng)重構(gòu)研究[D];廣西大學(xué);2013年
,本文編號(hào):1815839
本文鏈接:http://sikaile.net/kejilunwen/dianlilw/1815839.html