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

K. Nara*, Y. Hayashi, S. Muto, K. Tuchida

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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
Issue number1
Publication statusPublished - 2000 Mar 1
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'New feeder route determination algorithm by the Dijkstra method and tabu search'. Together they form a unique fingerprint.

Cite this