Optimum clustering of active distribution networks using back tracking search algorithm
Osama, Reham A.; Abdelaziz, Almoataz Y.; Swief, Rania; Ezzat, Mohamed; Saket, R. K.; Anand Kumar, K. S.;
Abstract
A microgrid has become the main building block of future distribution networks, demanding a systematic procedure for its optimal construction. Large distribution systems can be divided into clusters of distributed energy resources serving a group of distributed loads, known as microgrids to facilitate powerful control and operation. This paper compares the clustering of smart distribution systems into a set of microgrids based on two different objective functions. The probabilistic nature of intermittent distributed generators and loads is considered by performing a probabilistic Backward-Forward sweep power flow. The probabilistic approach aims to determine the optimal virtual cut set lines that split the system into self sufficient microgrids. The Back Tracking Search optimization algorithm is used to cluster a 69-bus distribution system with optimally allocated distributed generation units. The design concept, problem formulation, solution algorithms, probabilistic model and other graph related theories are presented in this paper.
Other data
| Title | Optimum clustering of active distribution networks using back tracking search algorithm | Authors | Osama, Reham A.; Abdelaziz, Almoataz Y.; Swief, Rania ; Ezzat, Mohamed; Saket, R. K.; Anand Kumar, K. S. | Keywords | Clustering;Distributed energy resources;Microgrids;Self adequacy | Issue Date | 1-Jan-2016 | Start page | 235 | End page | 246 | Conference | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | ISBN | 9783319489582 | ISSN | 03029743 | DOI | 10.1007/978-3-319-48959-9_21 | Scopus ID | 2-s2.0-85006886538 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.