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

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

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)25-30
Number of pages6
JournalInternational Journal of Engineering Intelligent Systems for Electrical Engineering and Communications
Volume8
Issue number1
Publication statusPublished - 2000 Mar
Externally publishedYes

Fingerprint

Tabu search
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{05324ff05f004470826f03bb05d5b513,
title = "New feeder route determination algorithm by the Dijkstra method and tabu search",
abstract = "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.",
author = "K. Nara and Yasuhiro Hayashi and S. Muto and K. Tuchida",
year = "2000",
month = "3",
language = "English",
volume = "8",
pages = "25--30",
journal = "International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications",
issn = "0969-1170",
publisher = "CRL Publishing",
number = "1",

}

TY - JOUR

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

AU - Nara, K.

AU - Hayashi, Yasuhiro

AU - Muto, S.

AU - Tuchida, K.

PY - 2000/3

Y1 - 2000/3

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

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

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

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

M3 - Article

AN - SCOPUS:0033903748

VL - 8

SP - 25

EP - 30

JO - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

JF - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

SN - 0969-1170

IS - 1

ER -