Unit Commitment by Hybrid Ant System/Priority List Method based Probabilistic Approach

この論文にアクセスする

この論文をさがす

著者

抄録

This paper presents a new method to solve the unit commitment problem by using a hybrid ant system/priority list method based probabilistic approach (HASP). The proposed methodology employs ant system (AS) in cooperating with the priority list method to commit generating units probabilistically corresponding to the specific conditions as means of mutually combining the advantages of them in that a flexibility of the priority list method is reinforced, while AS algorithm can gain the benefit of using a set of heuristics for improving its performance during search process under the operating constraints. The proposed methodology including its effective techniques has been tested on a system up to 100 generating units with a scheduling time horizon of 24 hours. The simulation results show that HASP gives better economical saving in total operating cost as well as faster computational time when compared to the earlier literature results.

収録刊行物

  • 電気学会論文誌. B, 電力・エネルギー部門誌 = The transactions of the Institute of Electrical Engineers of Japan. B, A publication of Power and Energy Society  

    電気学会論文誌. B, 電力・エネルギー部門誌 = The transactions of the Institute of Electrical Engineers of Japan. B, A publication of Power and Energy Society 128(7), 919-928, 2008-07-01 

    The Institute of Electrical Engineers of Japan

参考文献:  13件

参考文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

各種コード

  • NII論文ID(NAID)
    10021131046
  • NII書誌ID(NCID)
    AN10136334
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    03854213
  • NDL 記事登録ID
    9564754
  • NDL 雑誌分類
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL 請求記号
    Z16-794
  • データ提供元
    CJP書誌  NDL  J-STAGE 
ページトップへ