New feeder route determination algorithm by the Dijkstra method and tabu search

K. Nara*, Y. Hayashi, S. Muto, K. Tuchida

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

研究成果査読

抄録

When a feeder is newly installed in a distribution system, the route must be determined by taking into account investment cost and geographical constraints. It is difficult for planners to find the optimal route of the new feeder which satisfies geographical constraints. Because many candidates of routes exist which can be constructed along the road on service area and the new feeder route must not cross the existing feeders to simplify maintenance or operation of the distribution system. In this paper, in order to support planners' decision for selecting the least cost feeder route without crossing of a new feeder and existing feeders, the authors propose a new solution algorithm by dijkstra method and tabu search. Through numerical examples, authors demonstrate the validity of the proposed method.

本文言語English
ページ(範囲)25-30
ページ数6
ジャーナルInternational Journal of Engineering Intelligent Systems for Electrical Engineering and Communications
8
1
出版ステータスPublished - 2000 3 1
外部発表はい

ASJC Scopus subject areas

  • 制御およびシステム工学
  • コンピュータ サイエンスの応用
  • 電子工学および電気工学

フィンガープリント

「New feeder route determination algorithm by the Dijkstra method and tabu search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル