<dd id="mimiw"><samp id="mimiw"></samp></dd>

<address id="mimiw"><nav id="mimiw"><delect id="mimiw"></delect></nav></address>

    Suzhou Electric Appliance Research Institute
    期刊號: CN32-1800/TM| ISSN1007-3175

    Article retrieval

    文章檢索

    首頁 >> 文章檢索 >> 往年索引

    變電站選址定容規(guī)劃模型研究

    來源:電工電氣發(fā)布時間:2018-08-16 10:16 瀏覽次數(shù):679
    變電站選址定容規(guī)劃模型研究
     
    卓結(jié)彬,史文迪,朱亞東,鐘志祥
    (國網(wǎng)滁州供電公司,安徽 滁州 239000)
     
        摘 要:提出一種以所需費(fèi)用和供電隸屬關(guān)系變更次數(shù)最小為目標(biāo)的多階段多目標(biāo)變電站選址定容規(guī)劃模型。該模型不但考慮了變電站建設(shè)費(fèi)用、變壓器購置費(fèi)用和網(wǎng)絡(luò)損耗費(fèi)用,還滿足變電站實(shí)際運(yùn)行中的潮流約束、容量約束、供電半徑約束以及邏輯約束條件。為驗證所提模型的可行性,采用遺傳算法對算例進(jìn)行優(yōu)化求解,仿真結(jié)果表明了模型和所用算法的有效性。
        關(guān)鍵詞:多階段規(guī)劃;選址定容;網(wǎng)損費(fèi)用;供電隸屬關(guān)系;遺傳算法
        中圖分類號:TM715     文獻(xiàn)標(biāo)識碼:A     文章編號:1007-3175(2018)08-0046-05
     
    Research on Planning Model of Substation Location and Capacity
     
    ZHUO Jie-bin, SHI Wen-di, ZHU Ya-dong, ZHONG Zhi-xiang
    (State Grid Chuzhou Electric Power Supply Company, Chuzhou 239000, China)
     
        Abstract: This paper presented a new kind of multistage and multiobject planning model of substation location and capacity taking the alteration frequency minimum of required cost and power supply membership function as the the object. This proposed model not only included substation installation cost, transformer cost and network loss cost, but also met the conditions of tide constraint, capacity constraint, power supply radius constraint and logic constraint in the actual operation of the substation. In order to verify the feasibility of the model, this paper used the genetic algorithm to optimize an example. The simulation results validate the correctness and effectiveness of the developed model.
        Key words: multi stage programming; locating and sizing; network loss cost; power relationship; genetic algorithm
     
    參考文獻(xiàn)
    [1] 曹昉, 孟琦斌, 苗培青, 李越. 基于改進(jìn)加權(quán)Voronoi圖和遺傳算法的變電站規(guī)劃[J]. 電網(wǎng)技術(shù),2015,39(2):511-516.
    [2] 聶建春. 變電站選址的方法和在電網(wǎng)建設(shè)中的作用[J]. 山東工業(yè)技術(shù),2013(12):68.
    [3] 晉宏飛. 基于改進(jìn)微分進(jìn)化算法的變電站選址定容優(yōu)化研究[D]. 保定:華北電力大學(xué),2013.
    [4] MASUD E. An interactive procedure for sizing and timing distribution substations using optimization techniques[J]. IEEE Transactions on Power Apparatus and Systems,1974,93(5):1281-1286.
    [5] 王成山,劉濤,謝瑩華. 基于混合遺傳算法的變電站選址定容[J]. 電力系統(tǒng)自動化,2006,30(6):30-34.
    [6] 楊彥卿. 基于改進(jìn)粒子群算法的變電站選址問題研究[D]. 天津:河北工業(yè)大學(xué),2007.
    [7] 高付良,張鵬,賽雪,賽麗. 考慮負(fù)荷不確定性的變電站選址定容[J]. 電力系統(tǒng)保護(hù)與控制,2010,38(15):75-80.
    [8] 何林. 變電站選址定容方法的研究與實(shí)現(xiàn)[D]. 天津:天津大學(xué),2010.
    [9] 沈勇,盛軍其,符揚(yáng),施靈. 基于改進(jìn)粒子群算法的變電站選址定容[J]. 華東電力,2012,40(11):2043-2045.
    [10] 蘇海鋒. 配電系統(tǒng)規(guī)劃全壽命周期管理理論和方法研究[D]. 保定:華北電力大學(xué),2012.
    [11] 柳雙林,陳華豐,楊志剛. 基于改進(jìn)量子進(jìn)化算法的變電站選址方法[J]. 電氣技術(shù),2013,14(6):5-9.
    [12] 陳博. 改進(jìn)遺傳算法在含分布式電源的配電網(wǎng)規(guī)劃中的應(yīng)用研究[J]. 低碳世界,2016(4):32-33.
    [13] 李鑫濱,朱慶軍. 變電站選址定容新模型及其遺傳算法優(yōu)化[J]. 電力系統(tǒng)及其自動化學(xué)報,2009,21(3):32-35.
    [14] 孫雅平,蔡婷,薛仕軒. 改進(jìn)的遺傳算法在電網(wǎng)規(guī)劃中的研究[J]. 華東電力,2013,41(10):2095-2098.
    [15] 黃慧,顧波. 改進(jìn)遺傳算法在電網(wǎng)規(guī)劃中的應(yīng)用[J]. 電力系統(tǒng)保護(hù)與控制,2012,40(22):64-67.
    [16] LAKERVI E,NURMI M.Present status in applying mathematical planning methods in AM/FM-GIS systems[C]//14th International Conference and Exhibition on Electricity Distribution,1997:2-5.
    [17] 姚靜,方彥軍,李琦. 多目標(biāo)遺傳算法求解電力系統(tǒng)經(jīng)濟(jì)負(fù)荷分配[J]. 華東電力,2012,40(4):648-651.
    [18] TEMRAZ H K,SALAMA M M A.A planning model for siting, sizing and timing of distribution substations and defining the associated service area[J].Electric Power Systems Research,2002,62(2):145-151.

     

    亚洲无码av成人在线,亚洲影院AV无码一区二区,亚洲无码第二页,成人无码AV网站在线观看不卡 (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })();