Optimal sitting and sizing of distributed generations in distribution networks using Heuristic Algorithm

摘要

This paper presents a proposed approach to determine the optimal sitting and sizing of distributed generation (DGs) with multi-system constraints to achieve two objective functions using Heuristic Algorithm (HA). The algorithm is established by carrying out a sensitivity analysis to determine the most candidate buses, which the DGs are established. Then, power flow calculations are performed to define the buses that violate their voltage constraints. A distributed generating unit is located at one of the candidate buses, which have high sensitivity factor, and then; the power flow calculations are repeated. With no voltage constraints violation, the situation is saved as an acceptable solution and the economic situations are evaluated, taking into account the overall voltage deviations of all buses. The best economic operation is achieved by minimizing the objective functions and satisfying all the system constraints. This procedure is repeated for a distributed generating unit placed at different candidate buses including placing two and three DG units. A database is built to define the best solution under various loading conditions. The proposed approach is applied to a real section of the South Delta Electricity Distribution network, as a part of the 11 kV Egyptian networks. The demonstrated results ensure that the proper sitting and sizing of DGs are important to improve the voltage profile, reduce the power flows in critical lines and reduce the system power losses. According to the different loading conditions and voltage status, the required output power from the DG is defined based on a pre-established database. The proposed approach can provide a practical and fast solution for the electricity production problem in Egypt with the best voltage improvements.