DocumentCode
3045361
Title
Niche Genetic Algorithm and Minimum Spanning Tree for Substation Planning
Author
Wen, Peng ; Liu Wen-xia
Author_Institution
Sch. of Comput. Sci. & Technol., North China Electr. Power Univ., Beijing, China
Volume
3
fYear
2009
fDate
19-21 May 2009
Firstpage
61
Lastpage
65
Abstract
This paper presents a method based on niche genetic algorithm (NGA) and minimum spanning tree (MST) for substation planning. The problem of substation planning is divided into two parts: one is the capacity-determining and another is location-determining. The customer loads are represented a tree built by MST. Through clustering the loads, the capacity of every substation is calculated, and then the least square method is used to determine the location of substation with the objective function of minimal cost. NGA is employed to optimize the above process. Large amount of experiments show the effectiveness of our algorithm comparing with the other methods.
Keywords
genetic algorithms; least mean squares methods; power engineering computing; power system planning; trees (mathematics); capacity-determining problem; least square method; location-determining problem; minimum spanning tree; niche genetic algorithm; substation planning; Clustering algorithms; Genetic algorithms; Intelligent systems; Investments; Least squares methods; Mathematics; Power supplies; Power system planning; Substations; Technology planning; Minimum Spanning Tree; Niche Genetic Algorithm; substation planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems, 2009. GCIS '09. WRI Global Congress on
Conference_Location
Xiamen
Print_ISBN
978-0-7695-3571-5
Type
conf
DOI
10.1109/GCIS.2009.109
Filename
5209206
Link To Document