Tabu search algorithm for determining distribution tie lines

K. Nara*, Y. Hayashi, Y. Yamafuji, H. Tanaka, J. Hagihara, S. Muto, S. Takaoka, M. Sakuraoka

*この研究の対応する著者

研究成果: Paper査読

24 被引用数 (Scopus)

抄録

In planning a distribution system, when feeders are newly installed, several tie lines to other feeders must be determined among many candidates, considering investment cost and constraints. However, it is difficult for planners to find the optimal tie line set, because too many candidates exist which can be constructed along the road on service area of the power company. In this paper, in order to support planners' decision for selecting optimal tie line of newly installed feeders, the authors have formulated the problem mathematically, and propose a new solution algorithm by using Tabu Search to find superior tie lines. Through numerical examples, authors demonstrate the validity of the proposed method.

本文言語English
ページ266-270
ページ数5
出版ステータスPublished - 1996 1 1
外部発表はい
イベントProceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems - Orlando, FL, USA
継続期間: 1996 1 281996 2 2

Other

OtherProceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems
CityOrlando, FL, USA
Period96/1/2896/2/2

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • エネルギー(全般)
  • 工学(全般)

フィンガープリント

「Tabu search algorithm for determining distribution tie lines」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル