查詢結果分析
來源資料
相關文獻
- 位勢網絡法分析水庫容量
- 線性供水規則下水庫容量規劃模式--位勢網絡解釋與算法
- 水庫規劃問題的位勢網絡與流量網絡模式
- 水庫線性標的規劃模式與其對偶模式--互補解
- 水庫線性標的規劃模式與其對偶模式--網絡解釋
- 多功能水庫容量--位勢網絡模式與解法
- 以灰色線性規劃為基礎之重新調度法作動態發電分配
- Minimum-Torque Trajectory Planning of Redundant Manipulators between Two Joint Configurations
- A Novel Track Accessing Servo Design for a Dual Actuator System
- 以資料包絡法評量我國大學校院之教育品質
頁籤選單縮合
題 名 | 位勢網絡法分析水庫容量=Analysis of the Capacity of Reservoirs by the Method of Potential Network |
---|---|
作 者 | 劉佳明; | 書刊名 | 農業工程學報 |
卷 期 | 52:4 民95.12 |
頁 次 | 頁48-60 |
分類號 | 443.96 |
關鍵詞 | 多目標水庫; 水庫容量; 水庫規劃; 線性規劃; 位勢網絡; Multipurpose reservoir; Reservoir capacity; Reservoir planning; Linear programming; Potential network; |
語 文 | 中文(Chinese) |
中文摘要 | 本文藉簡單案例,說明具有供水、貯水與蓄洪功能水庫的操作、其位勢網絡解釋與最小容量方案演算法,並對單功能給水水庫有比較詳細的探討,主要內容如下: (1) 給水水庫容量方案操作模擬:考慮水庫水量收支平衡、蓄水量上限與下限等條件, (2) 多功能水庫供需位勢網絡圖:表示水庫供水、蓄洪與貯水三基本功能的供需時程, (3) 多功能水庫容量網絡演算法:利用水庫的供需網絡結構,設計其容量網絡演算法, (4) 給水水庫容量逆時累計算法:簡化網絡演算法為逆時累計法,並與傳統序列峰值法比較。 |
英文摘要 | A multipurpose reservoir is required to meet the given sets of demands for services: (1) reserved flood space f[8fa7], (2) net release ŷ[8fa7], or the difference of release and inflow, and (3) minimal pondage l[8fa7], where the time period t=1, 2, ..., n. It is to find the minimum capacity of the reservoir. The problem is interpreted as a potential network whose nodes and arcs visualize the states and the three functional services of the reservoir. The nodes correspond to the top v, the bottom o or the water level at different time of the reservoir. If the potentials, or volumes of these nodes are S□, Sо, and S[8fa7] respectively, then the arcs between some nodes represent respectively the supplied volumes of space, water, or pondage provided by the reservoir in terms of the potential differences of end nodes: S□-S[8fa7]≥f[8fa7], S[8fa7]-S□)≥ŷ[8fa7], S[8fa7]-Sо≥l[8fa7], t=1, 2, ... n. When every arc of the virtual network is assigned the demands defined above as its distance, the required minimal storage capacity to the reservoir to meet all the requirements is shown to be equal to the distance of the longest path from the bottom to the top of the potential network. An efficient algorithm which exploits the network structure of the problem is developed. It is then specialized for single purpose water supply reservoirs and results in a method that calculates backwardly the time sequence of water storages whose maximum is the required reservoir capacity. The method calculates forwardly in time the values of the cumulative sum of net release. It is different from the sequent peak method of Thomas and Fiering only in the direction of calculation. |
本系統中英文摘要資訊取自各篇刊載內容。