Skip to content
naulon
Not checkedNot checked for notices yet.

Advanced Pareto Front Non-Dominated Sorting Multi-Objective Particle Swarm Optimization for Optimal Placement and Sizing of Distributed Generation

Kumar Mahesh, Perumal Nallagownden, Irraivan Elamvazuthi

Energies · 2016

doi:10.3390/en9120982 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

This paper proposes an advanced Pareto-front non-dominated sorting multi-objective particle swarm optimization (Advanced-PFNDMOPSO) method for optimal configuration (placement and sizing) of distributed generation (DG) in the radial distribution system. The distributed generation consists of single and multiple numbers of active power DG, reactive power DG and simultaneous placement of active-reactive power DG. The optimization problem considers two multi-objective functions, i.e., power loss reduction and voltage stability improvements with voltage profile and power balance as constraints. First, the numerical output results of objective functions are obtained in the Pareto-optimal set. Later, fuzzy decision model is engendered for final selection of the compromised solution. The proposed method is employed and tested on standard IEEE 33 bus systems. Moreover, the results of proposed method are validated with other optimization algorithms as reported by others in the literature. The overall outcome shows that the proposed method for optimal placement and sizing gives higher capability and effectiveness to the final solution. The study also reveals that simultaneous placement of active-reactive power DG reduces more power losses, increases voltage stability and voltage profile of the system.

Abstract licence: CC BY

References44

    40 more references, whose wording the paper’s licence keeps private.

    All 44 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.