Abstract
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.
| Original language | English |
|---|---|
| Pages | 266-270 |
| Number of pages | 5 |
| Publication status | Published - 1996 Jan 1 |
| Externally published | Yes |
| Event | Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems - Orlando, FL, USA Duration: 1996 Jan 28 → 1996 Feb 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
- Computer Science(all)
- Energy(all)
- Engineering(all)
Fingerprint Dive into the research topics of 'Tabu search algorithm for determining distribution tie lines'. Together they form a unique fingerprint.
Cite this
Nara, K., Hayashi, Y., Yamafuji, Y., Tanaka, H., Hagihara, J., Muto, S., Takaoka, S., & Sakuraoka, M. (1996). Tabu search algorithm for determining distribution tie lines. 266-270. Paper presented at Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems, Orlando, FL, USA, .