Premium
Determination of newly installed feeder route considering use of existing feeder
Author(s) -
Nara Koichi,
Hayashi Yasuhiro,
Yamafuji Yukihiro,
Tanaka Hideo,
Hagihara Jun,
Muto Shoichi,
Tuchida Kotaro,
Sakuraoka Masahiro
Publication year - 1999
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/(sici)1520-6416(19991130)129:3<40::aid-eej5>3.0.co;2-q
Subject(s) - dijkstra's algorithm , service (business) , order (exchange) , operations research , computer science , investment (military) , mathematical optimization , engineering , reliability engineering , business , shortest path problem , mathematics , finance , graph , theoretical computer science , marketing , politics , law , political science
In planning a distribution system for an urban area, when a feeder is newly installed, the route of the feeder must be determined among many candidates, considering investment cost and constraints. However, it is difficult for planners to find the optimal route of the newly installed feeder, because too many candidate routes exist which can be constructed along roads in the service area of the power company, and it must be considered whether the end part of an existing feeder can be used as a part of a newly installed feeder within specified loaded value. In this paper, in order to support planners' decision making in selecting an optimal route for newly installed feeders, the authors have formulated the problem mathematically, and propose a new solution algorithm to find the optimal route by the Dijkstra method. Through numerical examples, the authors demonstrate the validity of the proposed method. © 1999 Scripta Technica, Electr Eng Jpn, 129(3): 40–50, 1999