Distribution Network Planning Considering Distributed Generation by Genetic Algorithm Combined with Graph Theory

Due to requirements for improving energy efficiency and meeting renewable and clean energy targets, an increasing amount of distributed generation is being connected to the distribution network. In order to facilitate increasing levels of distributed generation, the medium-voltage distribution netwo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Electric power components and systems Ročník 38; číslo 3; s. 325 - 339
Hlavní autori: Ouyang, Wu, Cheng, Haozhong, Zhang, Xiubin, Yao, Liangzhong, Bazargan, Masoud
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Taylor & Francis Group 01.01.2010
Taylor & Francis Ltd
Predmet:
ISSN:1532-5008, 1532-5016
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Due to requirements for improving energy efficiency and meeting renewable and clean energy targets, an increasing amount of distributed generation is being connected to the distribution network. In order to facilitate increasing levels of distributed generation, the medium-voltage distribution network planning method considering distributed generation connection is proposed in this article. In addition to constraints in the conventional medium-voltage network planning model, constraints related to distributed generation connection, such as short-circuit capacity and short-circuit ratio, are considered in the new planning model. To overcome the problems of low heritability and topological infeasibility of the existing genetic algorithm applied to the distribution network planning, this article develops the efficient genetic algorithm combined with graph theory, which avoids the generation of unfeasible configurations. The efficiency of the proposed planning method is shown using a realistic region distribution network in Shanghai.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1532-5008
1532-5016
DOI:10.1080/15325000903273429