z-logo
open-access-imgOpen Access
Optimal placement and sizing of distributed generation for loss minimization using ABC optimization
Author(s) -
Madhu Valavala
Publication year - 2021
Publication title -
international journal of applied power engineering
Language(s) - English
Resource type - Journals
eISSN - 2722-2624
pISSN - 2252-8792
DOI - 10.11591/ijape.v10.i4.pp347-354
Subject(s) - sizing , minification , computer science , reliability engineering , reliability (semiconductor) , probabilistic logic , mathematical optimization , matlab , distributed generation , power (physics) , operations research , engineering , renewable energy , electrical engineering , mathematics , art , physics , quantum mechanics , artificial intelligence , visual arts , operating system
The distributed generation (DG) refers to the use of the nearby units of small generation or in the sleefelzentres. Revisions have shown that unfitting choice of the position and scope of the DG can lead to bigger system sufferers than DG's sufferers. Public services are already available before the high loss of energy loss and of the mediocre voltage profile, in particular developing countries cannot tolerate any increase in losses. From optimal allocation, public services in the reduction of system losses improve tension adjustment and improve delivery reliability. This article aims to minimalize the annual system's annual loss through the appropriate positioning and size of the DG units. The artificials bee colony (ABC) of EPA are inspired by the behavior of the API feeding, this method is incredibly conventional, a stroke or a peoplated stochastic optimization algorithm to meet the solution of the specified problem. At MATLAB, a probabilistic approach is simulated to reach the target indicates that the size of the DGs to be installed to reduce almost the same loss as a percentage that the situation in which the load power is considered constant.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here