Tabu search algorithm for determining distribution tie lines

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

Tabu search algorithm for determining distribution tie lines

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

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

24 Citations (Scopus)

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)

Cite this

Tabu search algorithm for determining distribution tie lines. / Nara, K.; Hayashi, Y.; Yamafuji, Y.; Tanaka, H.; Hagihara, J.; Muto, S.; Takaoka, S.; Sakuraoka, M.

1996. 266-270 Paper presented at Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems, Orlando, FL, USA.

Research output: Contribution to conference › Paper › peer-review

@conference{278635f796634989bef62f4b7edca42b,

title = "Tabu search algorithm for determining distribution tie lines",

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.",

author = "K. Nara and Y. Hayashi and Y. Yamafuji and H. Tanaka and J. Hagihara and S. Muto and S. Takaoka and M. Sakuraoka",

year = "1996",

month = jan,

day = "1",

language = "English",

pages = "266--270",

note = "Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems ; Conference date: 28-01-1996 Through 02-02-1996",

}

TY - CONF

T1 - Tabu search algorithm for determining distribution tie lines

AU - Nara, K.

AU - Hayashi, Y.

AU - Yamafuji, Y.

AU - Tanaka, H.

AU - Hagihara, J.

AU - Muto, S.

AU - Takaoka, S.

AU - Sakuraoka, M.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029710605&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029710605&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029710605

SP - 266

EP - 270

T2 - Proceedings of the 1996 International Conference on Intelligent Systems Applications to Power Systems

Y2 - 28 January 1996 through 2 February 1996

ER -

Tabu search algorithm for determining distribution tie lines

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this