抄録
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月 28 → 1996 2月 2 |
Other
| Other | Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems |
|---|---|
| City | Orlando, FL, USA |
| Period | 96/1/28 → 96/2/2 |
ASJC Scopus subject areas
- コンピュータ サイエンス（全般）
- エネルギー（全般）
- 工学（全般）