ARTICLE
TITLE

Optimization of Distributed Generation Placement and Capacity Using Flower Pollination Algorithm Method

SUMMARY

The need for energy, especially electricity is increasing along with the development of technology. An increase in electrical load and the location of the powerplant far causes voltage drops and causes power line losses. One solution can be chosen by adding a distributed generation (DG) to the distribution network. This study aims to enhance the voltage profile and reduce power losses based on the optimal placement and capacity of DG-based photovoltaic (PV) in the Bantul Feeder 05 distribution network. The flower pollination algorithm (FPA) method is used to determine the optimal DG placement and capacity. The study was conducted using three additional DG scenarios, namely scenario 1 with single DG and scenario 2 with multi-DG (2 DG and 3 DG). The results showed that the optimal placement and capacity of DG were on buses 9, 19, and 33 with DG sizes of 1.880 kW, 2.550 kW, and 2.300 kW, respectively. This placement can increase the voltage profile and reduce the active power loss from 439.8 kW to 77.5 kW. The research also considers the increase in the reliability of the distribution system observe by the energy not supplied and cost of energy not supplied index.

 Articles related

I. Lutsenko,E. Fomovskaya,I. Oksanych,O. Serdiuk    

Context. The urgent verification problem of criterion for optimization of operational processes with the distributed parameters is solved.Objective is creation of a verification method for estimated criteria which have high selectivity and allow excludin... see more


Darko Skorin-Kapov    

We investigate the cost allocation strategy associated with the problem of providing some network service from source to a number of users, via the Minimum Cost Steiner Tree Network that spans the source and all the receivers. The cost of such a Steiner ... see more


Mahdi Zargayouna,Besma Zeddini    

Vehicle routing problems are highly complex problems. The proposals to solve them traditionally concern the optimization of conventional criteria, such as the number of mobilized vehicles and the total costs. However, in online vehicle routing problems, ... see more


Hamzah Noori Fejer,Mohanaed Ajmi Falih    

In this paper, a new method has been proposed to eliminate the weaknesses in the previous algorithms. The proposed method for data density clustering is reduced in the mapping programming model. Our analysis result shows that misleading data was presente... see more


Debdip KHAN,Dilip ROY    

The problem of Assembly Line Balancing is to assign a set of tasks to an ordered sequence of workstations without violating the precedence constraints. The efficiency of the line will increase when tasks are more evenly distributed. In general, the effic... see more