Journal
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
Volume 63, Issue -, Pages 609-617Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.ijepes.2014.06.023
Keywords
Distributed generation (DG); Mixed Integer Nonlinear Programming (MINLP); Optimal DG placement; Branch and Bound (BAB); Sequential Quadratic Programming (SQP)
Categories
Ask authors/readers for more resources
Loss reduction is one of the prime objectives for planning of distributed generation (DG). To improve performance of distribution systems, optimal placement of distributed generator is critically important, as DG benefits are site and size specific. Optimal placement of multiple DG units is non-convex and nonlinear optimization problem. The methodology proposed in this paper solves Mixed Integer Non-Linear Programming (MINLP) formulation for loss minimization. The proposed methodology simplifies the problem by dividing it in two phases, namely Siting Planning Model (SPM) and Capacity Planning Model (CPM) thereby reducing the search space and computational time. The SPM model selects the candidate buses based on Combined Loss Sensitivity (CLS). In CPM, optimal locations and sizes are obtained by integrating Sequential Quadratic Programming (SQP) and Branch and Bound (BAB) algorithm for MINLP problem. The performance of the proposed method is tested on IEEE 33-bus and IEEE 69-bus distribution system for placement of single and multiple DG units capable of delivering either real or both real and reactive power. The obtained results are then compared with three basic classes of optimization methods, viz., Exhaustive Load Flow (ELF), Improved Analytical (IA) and Particle Swarm Optimization (PSO). The key advantage of the proposed method is that it simultaneously considers placement of multiple DG units giving better optimal solution in reasonably less computational time. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available