<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
    期刊號(hào): CN32-1800/TM| ISSN1007-3175

    Article retrieval

    文章檢索

    首頁(yè) >> 文章檢索 >> 往年索引

    考慮環(huán)保性與自治性的主動(dòng)配電網(wǎng)能量?jī)?yōu)化管理

    來(lái)源:電工電氣發(fā)布時(shí)間:2019-06-13 13:13 瀏覽次數(shù):791
    考慮環(huán)保性與自治性的主動(dòng)配電網(wǎng)能量?jī)?yōu)化管理
     
    宋學(xué)偉1,劉天羽1,劉玉瑤2
    (1 上海電機(jī)學(xué)院 電氣學(xué)院,上海 201306;2 國(guó)網(wǎng)山東省電力公司東營(yíng)市墾利區(qū)供電公司,山東 東營(yíng) 257000)
     
        摘 要:在滿足約束條件的基礎(chǔ)上,提出了基于經(jīng)濟(jì)性、環(huán)保性、自治性的主動(dòng)配電網(wǎng)能量?jī)?yōu)化管理模型,并針對(duì)煙花算法(FWA)存在的計(jì)算速度慢、精度低等問(wèn)題,提出改進(jìn)策略,應(yīng)用改進(jìn)煙花(SHFWA)算法來(lái)計(jì)算主動(dòng)配電網(wǎng)的能量?jī)?yōu)化管理問(wèn)題。算例結(jié)果表明,SHFWA算法解決了FWA算法求解精度低、收斂速度慢的問(wèn)題,實(shí)現(xiàn)了主動(dòng)配電網(wǎng)的優(yōu)化運(yùn)行。
        關(guān)鍵詞:主動(dòng)配電網(wǎng);經(jīng)濟(jì)性;環(huán)保性;自治性;改進(jìn)煙花算法
        中圖分類號(hào):TM73     文獻(xiàn)標(biāo)識(shí)碼:A     文章編號(hào):1007-3175(2019)06-0058-05
     
    Energy-Optimized Management of Active Distribution Network Considering Environmental Protection and Autonomy
     
    SONG Xue-wei1, LIU Tian-yu1, LIU Yu-yao2
    (1 School of Electrical Engineering, Shanghai Dianji University, Shanghai 201306, China;
    2 State Grid Shandong Electric Power Conpany Dongying Kenli District Power Supply Company, Dongying 257000, China)
     
        Abstract: On the basis of satisfying the constraints, this paper proposed an energy optimization management model based on economy, considering environmental protection and autonomy. Aiming at the problems such as slow speed calculation and low precision existing in fireworks algorithm (FWA), this paper proposed the improved strategy. The improved algorithm was applied to solve the optimal management problem of active distribution network. The results of the example show that the improved algorithm solves the problem of low precision and slow convergence of the fireworks algorithm, and realizes the optimal operation of the active distribution network.
        Key words: active distribution network; economy; environmental protection; autonomy; improved fireworks algorithm
     
    參考文獻(xiàn)
    [1] 丁明,石雪梅. 新能源接入對(duì)主動(dòng)配電網(wǎng)的影響[J]. 電力建設(shè),2015,36(1):76-84.
    [2] 劉廣一,張凱,舒彬. 主動(dòng)配電網(wǎng)的6 個(gè)主動(dòng)與技術(shù)實(shí)現(xiàn)[J]. 電力建設(shè),2015,36(1):33-37.
    [3] 張明銳,陳潔,杜志超,等. 考慮交互功率控制的微網(wǎng)經(jīng)濟(jì)運(yùn)行[J]. 中國(guó)電機(jī)工程學(xué)報(bào),2014,34(7):1013-1023.
    [4] LI Jinghua, WANG Sai, YE Liu, et al. A coordinated dispatch method with pumpedstorage and battery-storage for compensating the variation of wind power[J].Protection and Control of Modern Power Systems,2018,3(3):21-34.
    [5] 蒲天驕,劉克文,李燁,等. 基于多代理系統(tǒng)的主動(dòng)配電網(wǎng)自治協(xié)同控制及其仿真[J]. 中國(guó)電機(jī)工程學(xué)報(bào),2015,35(8):1864-1874.
    [6] 韓笑,周明,李庚銀. 計(jì)及儲(chǔ)能和空調(diào)負(fù)荷的主動(dòng)配電網(wǎng)多目標(biāo)優(yōu)化調(diào)度[J]. 電力系統(tǒng)保護(hù)與控制,2018,46(7):14-23.
    [7] 徐嘉斌,張?chǎng)危瑥堄裾?,? 基于改進(jìn)煙花算法的礦用配電網(wǎng)重構(gòu)[J]. 工礦自動(dòng)化,2018,44(9):32-36.
    [8] 陳如清,李嘉春,尚濤,等. 改進(jìn)煙花算法和概率神經(jīng)網(wǎng)絡(luò)智能診斷齒輪箱故障[J]. 農(nóng)業(yè)工程學(xué)報(bào),2018,34(17):192-198.
    [9] 曾德良,鄧志光,陳彥橋. 改進(jìn)煙花算法在火電廠負(fù)荷優(yōu)化分配中的應(yīng)用[J]. 應(yīng)用科學(xué)學(xué)報(bào),2018,36(3):542-552.
    [10] TOMA L,TRISTIU I,BULAC C,et al.Optimal generation scheduling strategy in a microgrid[C]//IEEE Transportation Electrification Conference and Expo, Asia-Pacific,2016:491-496.
    [11] 黃晨,張靠社. 基于量子粒子群算法的微電網(wǎng)優(yōu)化調(diào)度[J]. 電網(wǎng)與清潔能源,2016,32(2):72-76.
    [12] 趙磊,曾芬鈺,王霜,等. 基于經(jīng)濟(jì)性與環(huán)保性的微電網(wǎng)多目標(biāo)優(yōu)化調(diào)度研究[J]. 高壓電器,2015,51(6):127-132.
     

     

    亚洲无码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); })();