書誌事項
- タイトル別名
-
- A Practical Algorithm for Unit Commitment Based on Unit Decommitment Ranking
- ケイトウ ヒョウカ ノ タメ ノ テイシ ランキング ニ モトヅク デンゲン キドウ テイシ ケイカク シュホウ
この論文をさがす
抄録
This paper presents a practical algorithm for solving unit commitment (UC) problems with network constraints represented in Optimal Power Flow (OPF). The proposed algorithm is based on Successive Approximation Dynamic Programming (SADP) according to a Unit Decommitment Ranking (UDR) which is a priority list for unit decommitment procedure. The UDR can be determined by Dynamic Programming (DP) according to the information of OPF consisting a set of Lagrange multipliers (dual variables). Since the set of Lagrange multipliers represents the relationship between the optimal value of objective function and OPF constraints, the proposed algorithm can determine power system resource scheduling in consideration of network constraints, such as line flow and voltage constraints. The feasibility and effectiveness of the proposed algorithm are demonstrated on a modified IEEE Reliability Test System.
収録刊行物
-
- 電気学会論文誌Ｂ（電力・エネルギー部門誌）
-
電気学会論文誌Ｂ（電力・エネルギー部門誌） 120 (12), 1595-1606, 2000
一般社団法人 電気学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679582217728
-
- NII論文ID
- 130006841976
- 10005721456
-
- NII書誌ID
- AN10136334
-
- ISSN
- 13488147
- 03854213
- http://id.crossref.org/issn/03854213
-
- NDL書誌ID
- 5585018
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可