多設備拡張計画問題のモデルとその解法について

• 馬郡 英樹

  東電設計（株）

• 横山 隆一

  東京都立大学

書誌事項

タイトル別名

• On the Model and Solution Methods for Multi-Facility Capacity Expansion Problem
• タセツビ カクチョウ ケイカク モンダイ ノ モデル ト ソノ カイホウ ニ ツイテ

抄録

Capacity expansion problem is a hard combinatorial problem to solve because it must treat many scheduling subproblems within a multi-facility framework. It is classified into a category of general Investment & Operation planning problems. This paper presents a basic model for a certain class of capacity expansion problem applicable to the generation expansion problem in power systems, and proposes several mathematical methods for the model. In the field of Operational Research, Dynamic Programming (DP) has been the most popular method under multistage dynamic environments. It is however made clear in the paper that the model cannot be exactly solved by standard DPs. Consequently, another representative methods such as Lagrangian Relaxation, Branch-and-Bound and Heuristics are also tailored as alternatives for DP and compared with each other. Computational experiments by all proposed methods yielded promising suboptima with quality guarantee, among others Branch-and-Bound and Lagrangian Relaxation methods are recommended as suitable ones for the model.

収録刊行物

• 電気学会論文誌Ｂ（電力・エネルギー部門誌）

  電気学会論文誌Ｂ（電力・エネルギー部門誌） 123 (12), 1562-1572, 2003

  一般社団法人 電気学会

キーワード

• 設備計画
• 組合せ最適化
• 動的計画法
• ラグランジュ緩和法
• 分枝限定法
• ヒューリスティックス

詳細情報

• CRID: 1390001204603076480
• NII論文ID: 10012556394
• NII書誌ID: AN10136334
• DOI: 10.1541/ieejpes.123.1562
• ISSN: 13488147
• ISSN: 03854213
• NDL書誌ID: 6781790
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I6781790
• Web Site: http://www.jstage.jst.go.jp/article/ieejpes/123/12/123_12_1562/_pdf
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可