Engineering

Permanent URI for this community

https://hdl.handle.net/20.500.11888/3184

Browse

Browsing Engineering by Subject "electrical power"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Optimal Sizing and Placement of Distributed Generation Using an Improved Particle Swarm Optimization (IPSO) Method for Power Loss Reduction and Voltage Stability Improvement
    (ِAn-Najah National University, 2018-03-23) Hantash, Neda
    The integration of distributed generation (DG) units in power distribution networks has become very important field in recent years. The aim of the optimal DG planning is to provide the best locations and sizes of DGs to optimize electrical distribution network operation taking into account DG capacity constraints. In this thesis an improved particle swarm optimization method (IPSO) is proposed to optimally choose suitable DG unit in accordance to DG size and location so as to improve voltage profile and reduce active power losses. IEEE 34 distribution bus system is used as a case study for this research. A new equation of weight inertia is proposed so as to improve the performance of conventional PSO algorithm. This development is done by controlling the inertia weight which affects the updating velocity of particles in the algorithm. Maltab codes are developed for electric power system, improved PSO algorithm and power flow analysis so as to conduct the research. Results show that the applied conventional PSO algorithm successfully finds the optimal size and location of the desired DG unit with a capacity of 1.6722 MW at bus number 10. This makes the voltage magnitude equals to 1.0055 pu and improves the status of the power system in general. The minimum value of fitness losses using the applied algorithm is 0.0406 while average elapse time is 78.6212 s. In addition to that, the applied PSO algorithm reduces the active power losses by 31.61%. As a comparison, conventional PSO algorithm that is based on linear inertia weight equations consumes 78.6212 s and 69.0836 s to provide the optimum solution. In the meanwhile, the proposed algorithm consumes 62.2325 s to provide the optimum solution