Optimal sizing and placement of distributed generation in Egyptian radial distribution systems using crow search algorithm

In recent years, the integration of distributed generation (DG) sources in electrical distribution systems has become increasingly essential due to their multiple advantages such as power loss reduction, voltage profile improvement, and relieved system's congestion. These benefits can be obtained by optimal sizing and placement of the DG sources. In this paper, a recent population-based optimization, known as Crow Search Algorithm (CSA), is used for the sizing and placement of DG in radial distribution networks. Loss sensitivity factor (LSF) is used to initially determine the most candidate buses for DG installation. Three DG types have been examined. The proposed algorithm is applied to a real Egyptian distribution system, and the achieved results revealed the effectiveness of the CSA in reducing the network losses and maximizing the overall saving while considering various load types such as constant power, constant impedance, and constant current.

I. Introduction

Distributed generation (DG) sources are small-scale distributed sources of electric power, which are mostly placed at the distribution networks close to the loads being fed [1]. Nowadays, many DG technologies exist, such as wind turbines (WT), photovoltaic (PV), fuel cells, biomass, small hydro, micro-turbines, and others. DG has been widely integrated into the distribution systems due to its various technical and economic benefits such as reduced system losses, enhanced system's voltage profile, clean energy production and reduced pollutants' emissions, improved system reliability, power quality improvements, and relieved transmission and distribution congestion [2]. These benefits can be maximized by selecting the optimal DG size and integration location. However, inappropriate determination of DG size or location may lead to increased system losses and costs which cannot be tolerated by the distribution system operators (DSO) [3].