Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33100
Title: A novel heuristic method for distribution system planning
Authors: Chen, GJ
Tang, GQ
Li, KK
Chung, TS
Issue Date: 2001
Source: Electric power components and systems, 2001, v. 29, no. 6, p. 491-502
Abstract: Numerous mathematical optimization methods have been used to obtain the optimal solution to the problem of distribution system planning, which often are time consuming and only restricted to small size distribution systems. In this paper, a novel heuristic method is developed to solve the problem of distribution system planning. The method is composed of three steps. First of all, an initial redundant network is formed by combining the existing network and the probable new additions. A new efficient two-stage load flow method is presented and integrated into a recursive process to determine the optimal combination of substations and derive their service areas. Secondly, a heuristic approach is used to obtain the radial network configuration of each substation. Finally, an algorithm based on branch exchange technique is implemented between elements of adjacent distribution zones to obtain the final planning scheme. A distribution system with 6 substations and 98 feeders is studied, which demonstrates the feasibility and efficiency of the proposed method.
Keywords: Branch exchange
Distribution system planning
Heuristic method
Load flow
Publisher: Taylor & Francis
Journal: Electric power components and systems 
ISSN: 1532-5008
EISSN: 1532-5016
DOI: 10.1080/153250001300338736
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Sep 7, 2020

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 13, 2020

Page view(s)

100
Last Week
0
Last month
Citations as of Sep 14, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.