New algorithm for distribution feeder expansion planning for urban area

K. Nara, Yasuhiro Hayashi, S. Muto, K. Tuchida

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, in order to support planners' decision for feeder expansion planning, the authors propose a method that the least cost expansion facilities can be obtained by searching all the candidates which satisfies the expansion constraints such as voltage drop as well as geographical installation restrictions. In the proposed method, dual efficient gradient method, Dijkstra method, Ford-Fulkerson method and tabu search are implemented to obtain superior feeder expansion plan. Through numerical examples, the validity of the proposed method is verified.

Original languageEnglish
Title of host publicationIEE Conference Publication
Editors Anon
PublisherIEE
Pages192-197
Number of pages6
Edition450
Publication statusPublished - 1998 Jan
Externally publishedYes
EventProceedings of the 1997 4th International Conference on Advances in Power System Control, Operation and Management. Part 1 (of 2) - Hong Kong, Hong Kong
Duration: 1997 Nov 111997 Nov 14

Other

OtherProceedings of the 1997 4th International Conference on Advances in Power System Control, Operation and Management. Part 1 (of 2)
CityHong Kong, Hong Kong
Period97/11/1197/11/14

Fingerprint

Planning
Gradient methods
Tabu search
Costs
Voltage drop

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Nara, K., Hayashi, Y., Muto, S., & Tuchida, K. (1998). New algorithm for distribution feeder expansion planning for urban area. In Anon (Ed.), IEE Conference Publication (450 ed., pp. 192-197). IEE.

New algorithm for distribution feeder expansion planning for urban area. / Nara, K.; Hayashi, Yasuhiro; Muto, S.; Tuchida, K.

IEE Conference Publication. ed. / Anon. 450. ed. IEE, 1998. p. 192-197.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nara, K, Hayashi, Y, Muto, S & Tuchida, K 1998, New algorithm for distribution feeder expansion planning for urban area. in Anon (ed.), IEE Conference Publication. 450 edn, IEE, pp. 192-197, Proceedings of the 1997 4th International Conference on Advances in Power System Control, Operation and Management. Part 1 (of 2), Hong Kong, Hong Kong, 97/11/11.
Nara K, Hayashi Y, Muto S, Tuchida K. New algorithm for distribution feeder expansion planning for urban area. In Anon, editor, IEE Conference Publication. 450 ed. IEE. 1998. p. 192-197
Nara, K. ; Hayashi, Yasuhiro ; Muto, S. ; Tuchida, K. / New algorithm for distribution feeder expansion planning for urban area. IEE Conference Publication. editor / Anon. 450. ed. IEE, 1998. pp. 192-197
@inproceedings{918217b2720c46d58196d00308480cce,
title = "New algorithm for distribution feeder expansion planning for urban area",
abstract = "In this paper, in order to support planners' decision for feeder expansion planning, the authors propose a method that the least cost expansion facilities can be obtained by searching all the candidates which satisfies the expansion constraints such as voltage drop as well as geographical installation restrictions. In the proposed method, dual efficient gradient method, Dijkstra method, Ford-Fulkerson method and tabu search are implemented to obtain superior feeder expansion plan. Through numerical examples, the validity of the proposed method is verified.",
author = "K. Nara and Yasuhiro Hayashi and S. Muto and K. Tuchida",
year = "1998",
month = "1",
language = "English",
pages = "192--197",
editor = "Anon",
booktitle = "IEE Conference Publication",
publisher = "IEE",
edition = "450",

}

TY - GEN

T1 - New algorithm for distribution feeder expansion planning for urban area

AU - Nara, K.

AU - Hayashi, Yasuhiro

AU - Muto, S.

AU - Tuchida, K.

PY - 1998/1

Y1 - 1998/1

N2 - In this paper, in order to support planners' decision for feeder expansion planning, the authors propose a method that the least cost expansion facilities can be obtained by searching all the candidates which satisfies the expansion constraints such as voltage drop as well as geographical installation restrictions. In the proposed method, dual efficient gradient method, Dijkstra method, Ford-Fulkerson method and tabu search are implemented to obtain superior feeder expansion plan. Through numerical examples, the validity of the proposed method is verified.

AB - In this paper, in order to support planners' decision for feeder expansion planning, the authors propose a method that the least cost expansion facilities can be obtained by searching all the candidates which satisfies the expansion constraints such as voltage drop as well as geographical installation restrictions. In the proposed method, dual efficient gradient method, Dijkstra method, Ford-Fulkerson method and tabu search are implemented to obtain superior feeder expansion plan. Through numerical examples, the validity of the proposed method is verified.

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

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

M3 - Conference contribution

SP - 192

EP - 197

BT - IEE Conference Publication

A2 - Anon, null

PB - IEE

ER -