本文選題：水電站群 + 調(diào)峰調(diào)度��； 參考：《中國(guó)電機(jī)工程學(xué)報(bào)》2017年15期

【摘要】：由于受到系統(tǒng)規(guī)模逐年擴(kuò)大、調(diào)度要求日趨精細(xì)和約束集合日漸龐雜等諸多因素影響,如何快速制定合理的發(fā)電調(diào)度計(jì)劃是水電站群聯(lián)合調(diào)度面臨的關(guān)鍵科學(xué)難題,集中體現(xiàn)在初始解的快速生成機(jī)制、決策空間的科學(xué)辨識(shí)模式以及行之有效的優(yōu)化調(diào)度方法等3個(gè)方面。為此,從工程實(shí)用化角度出發(fā),提出求解水電站群聯(lián)合調(diào)峰調(diào)度問(wèn)題的均勻逐步優(yōu)化方法。該方法首先依據(jù)水電系統(tǒng)相鄰日運(yùn)行工況估算各水電站可能發(fā)電能力,并由上游到下游依次采用切負(fù)荷方法來(lái)快速生成初始解;然后將多階段決策問(wèn)題分解為若干兩階段子問(wèn)題進(jìn)行求解,并將均勻試驗(yàn)設(shè)計(jì)耦入各階段決策變量集合的構(gòu)造工作,指導(dǎo)算法優(yōu)選少數(shù)富有代表性的決策變量,大幅減少運(yùn)算量與存儲(chǔ)量,進(jìn)而降低方法的計(jì)算復(fù)雜度;同時(shí),在尋優(yōu)過(guò)程中將多重復(fù)雜運(yùn)行約束統(tǒng)一集成至指定約束,以動(dòng)態(tài)辨識(shí)可行搜索空間,進(jìn)而降低算法的計(jì)算消耗。工程應(yīng)用結(jié)果表明,所提方法可快速獲得滿(mǎn)意調(diào)度結(jié)果,能夠切實(shí)服務(wù)于水電調(diào)度運(yùn)行工作的開(kāi)展。
[Abstract]:Due to the influence of many factors, such as the increasing scale of the system, the increasingly fine dispatching requirements and the increasingly complex set of constraints, how to quickly formulate a reasonable power generation dispatching plan is a key scientific problem faced by the joint operation of hydropower stations. It is mainly reflected in three aspects: the quick generation mechanism of initial solution, the scientific identification model of decision space and the effective optimal scheduling method. For this reason, from the point of view of engineering practicality, a uniform stepwise optimization method for solving the problem of joint peak-shaving operation of hydropower stations is proposed. In this method, the potential power generation capacity of hydropower stations is estimated according to the daily operating conditions of hydropower system, and the initial solution is generated quickly by load shedding method from upstream to downstream. Then the multi-stage decision problem is decomposed into several two-stage sub-problems, and the uniform test design is coupled into the set of decision variables to guide the algorithm to select a few representative decision variables. The computational complexity of the method is greatly reduced by reducing the amount of computation and storage, and at the same time, the multi-complex running constraints are integrated into the specified constraints in the optimization process to dynamically identify the feasible search space, thus reducing the computational cost of the algorithm. The engineering application results show that the proposed method can quickly obtain satisfactory dispatching results and can effectively serve the development of hydropower dispatching operation.
【作者單位】： 華中科技大學(xué)水電與數(shù)字化工程學(xué)院;大連理工大學(xué)水電與水信息研究所;
【基金】：國(guó)家自然科學(xué)基金項(xiàng)目(91547201,51210014) 國(guó)家重點(diǎn)基礎(chǔ)研究發(fā)展計(jì)劃項(xiàng)目(973項(xiàng)目)(2013CB035906)~~
【分類(lèi)號(hào)】：TM73

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 崔清溪,王智中;用矩陣運(yùn)算求解水電站群最優(yōu)裝機(jī)容量[J];長(zhǎng)江水利教育;1993年02期

2 馬元s，

本文編號(hào)：2082957