書誌事項
- タイトル別名
-
- A Solution for Unit Commitment Problem Considering LNG Fuel Constaraints
- LNG ネンリョウ ショウヒ セイヤク オ コウリョシタ ハツデンキ キドウ
この論文をさがす
抄録
In this paper, an algorithm is proposed to find a quasi-optimal schedule for the short-term thermal unit commitment problem considering LNG fuel constraints.<br> In recent years, LNG fuel is used increasingly. As a result, LNG fuel constraints should be considered in making a unit commitment schedule. Generally, unit commitment is a non-linear combinatorial problem including discrete variables. Adding LNG fuel constraints extensively increases the complexity of the problem. To solve the problem, a two-step algorithm is developed using mathematical programming methods. First a Linear Porgramming problem is solved to determine the amount of LNG fuel to be consumed by each LNG unit, then a Lagrangian Relaxation approach is used to obtain a unit commitment schedule. This two-step algorithm simplifies the problem and thus has good characteristics in convergence.<br> To test the effectiveness of the proposed algorithm, a numerical simulation is carried out on a 46-unit thermal system over a 24-hour period. The result is obtained with the dual-gap of 0.00546.
収録刊行物
-
- 電気学会論文誌B(電力・エネルギー部門誌)
-
電気学会論文誌B(電力・エネルギー部門誌) 116 (12), 1517-1523, 1996
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204606476032
-
- NII論文ID
- 130006842552
- 10009874377
-
- NII書誌ID
- AN10136334
-
- ISSN
- 13488147
- 03854213
-
- NDL書誌ID
- 4086757
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可