A Novel Approach for Optimal Allocation of a Distributed Generator in a Radial Distribution Feeder for Loss Minimization and Tail End Node Voltage Improvement during Peak Load
Maruthi Prasanna. H. A.1,, Likith Kumar. M. V.2, T. Ananthapadmanabha3
1Assistant Engineer (Ele), Karnataka Power Transmission Corporation Limited (KPTCL), Bangalore, India
2Research Scholar, Department of Electrical Engineering, The National Institute of Engineering, Mysore, India
3Professor, Department of Electrical Engineering, The National Institute of Engineering, Mysore, India
Abstract
This paper proposes a novel approach for optimal allocation of a distributed generator in a radial distribution feeder for loss minimization and tail end node voltage improvement during peak load. A multi objective optimization method is proposed to determine optimal allocation of a distributed generation (DG) unit in a radial distribution feeder. The DG allocation problem has been formulated as multi objective function which includes two objectives: viz Power Loss Reduction and Tail End Node Voltage Improvement with associated weights. The proposed methodology uses Genetic Algorithm to optimize the multi objective function. This method is tested on standard IEEE 33 bus radial distribution system using MATLAB 8.0. The results show that the proposed method yields significant reduction in line losses and considerable tail end node voltage improvement during peak load.
At a glance: Figures
Keywords: distribution system, distributed generation, TENVD Index, PLR Index, genetic algorithm
International Transaction of Electrical and Computer Engineers System, 2014 2 (2),
pp 67-72.
DOI: 10.12691/iteces-2-2-4
Received January 09, 2014; Revised February 22, 2014; Accepted March 14, 2014
Copyright © 2013 Science and Education Publishing. All Rights Reserved.Cite this article:
- A., Maruthi Prasanna. H., Likith Kumar. M. V., and T. Ananthapadmanabha. "A Novel Approach for Optimal Allocation of a Distributed Generator in a Radial Distribution Feeder for Loss Minimization and Tail End Node Voltage Improvement during Peak Load." International Transaction of Electrical and Computer Engineers System 2.2 (2014): 67-72.
- A., M. P. H. , V., L. K. M. , & Ananthapadmanabha, T. (2014). A Novel Approach for Optimal Allocation of a Distributed Generator in a Radial Distribution Feeder for Loss Minimization and Tail End Node Voltage Improvement during Peak Load. International Transaction of Electrical and Computer Engineers System, 2(2), 67-72.
- A., Maruthi Prasanna. H., Likith Kumar. M. V., and T. Ananthapadmanabha. "A Novel Approach for Optimal Allocation of a Distributed Generator in a Radial Distribution Feeder for Loss Minimization and Tail End Node Voltage Improvement during Peak Load." International Transaction of Electrical and Computer Engineers System 2, no. 2 (2014): 67-72.
Import into BibTeX | Import into EndNote | Import into RefMan | Import into RefWorks |
1. Introduction
As a result of the application of deregulation in the electric power sector, a new identity appeared in the electric power system map known as “distributed generation” [1]. In general, Distributed Generation (DG) can be defined as electric power generation within distribution networks or on the customer side of the meter [2].
Most of the benefits of employing DG units in existing distribution networks have both economic and technical implications and they are interrelated [3]. The major technical benefits include:
• Reduction of line losses
• Voltage profile improvement
• Increased overall energy efficiency
• Enhanced system reliability and security
• Relieved T&D congestion
The major economical benefits include:
• Deferred investments for upgrades of facilities
• Reduced O&M costs of some DG technologies
• Reduced fuel costs due to increased overall efficiency
• Lower operating costs due to peak shaving and
• Increased security for critical loads
There is increased interest by electricity suppliers in DG because they see it as a tool that can help them to fill niches in a liberalized market. In such a market, customers will look for the electricity services best suited for them. Different customers attach different weights to features of electricity supply, and DG technologies can help electricity suppliers to supply to the electricity customers the type of electricity service they prefer. In short, DG allows players in the electricity sector to respond in a flexible way to changing market conditions [4].
Determining the suitable location and size of DG is important in order to extract maximum benefits from the integration of DG into the distribution system. In literature, there are a number of approaches developed for placement and sizing of DG units in distribution system. Chiradeja and Ramkumar [3] presented a general approach and set of indices to assess and quantify the technical benefits of DG in terms of voltage profile improvement, line loss reduction and environmental impact reduction. Khan and Choudry [5] developed an algorithm based on analytical approach to improve the voltage profile and to reduce the power loss under randomly distributed load conditions with low power factor for single DG as well as multi DG systems. Hung et al. [6] used an improved analytical method for identification of the best location and optimal power factor for placing multiple DGs to achieve loss reduction in large scale primary distribution networks. Kamel and Karmanshahi [7] proposed an algorithm for optimal sizing and siting of DGs at any bus in the distribution system to minimize losses and found that the total losses in the distribution network would reduce by nearly 85%, if DGs were located at the optimal locations with optimal sizes.
The genetic algorithm (GA) is an optimization and search technique based on the principles of genetics and natural selection. Application of GA to determine optimal allocation of DG proved to be an efficient technique and many authors has succeeded in applying it [8, 9, 10, 11]. Mithulananthan et al. [8] have tried it taking power loss minimization alone as objective. Many authors also tried PSO for DG optimization problem [20, 22]. Some authors have tried multi objective optimization in which they have considered voltage profile improvement as additional objective along with power loss minimization [9, 10, 11]. Even though the voltage profile improvement was taken as one of the objective for DG allocation in many multi-objective allocation optimization which has been reported in the literatures, the tail end nodes voltages are not improved much. But in practical distribution systems, tail end nodes are victims of voltage drop. The voltage drop across the distribution feeder will results in poor voltage at the tail end nodes there by affecting performance of customer equipments. So it is necessary to give special attention to improve tail end node voltage profile.
The method proposed in this paper attempts to solve critical tail end node voltage problem by framing optimal allocation of DG problem as a multi objective problem using Genetic Algorithms (GA). Two indices viz Power Loss Reduction Index (PLRI) and Tail End Node Voltage Deviation Index (TENVDI) are combined together to obtain objective function to be minimized to get optimal allocation of DG such that minimum power loss and maximum tail end voltage improvement is achieved. The proposed methodology is implemented using MATLAB 8.0.
The organization of this paper is as follows; section 2 addresses the problem formulation, section 3 introduces the Genetic Algorithm used in the methodology, & Section 4 gives the solution method, Results & discussion are given in section 5 of the paper.
2. Multi-Objective Problem Formulation
Optimum allocation of DG units are decided in such a way that the combined objective function of power loss reduction index and tail end node voltage deviation index is minimum. So it is needed to define objective function in terms of DG size, location & system bus voltage.
The total power loss of distribution network is given by,
(1) |
Where,
– branch number.
– total number of branches.
– ith branch current.
– ith branch resistance.
– real power loss of distribution system.
The “Power Loss Reduction Index (PLRI)” is given by,
(2) |
Where,
– power loss with DG.
– power loss without DG.
The “Tail End Node Voltage Deviation Index (TENVDI)” is given by,
(3) |
Where,
– bus number.
– number of tail end nodes.
– total number of nodes.
– ith node voltage.
The “TENVDI in Pu” is given by,
(4) |
Where,
– Tail End Node Voltage Deviation
Index with DG.
– Tail End Node Voltage Deviation
of Basecase without DG.
The Multi Objective Function is formulated as,
(5) |
Such that,
(6) |
Subject to Constraints:
1. Line loadability limit:
2. Bus Voltage limit:
The objective function ‘F’ is a combination of power loss reduction index (PLRI) & tail end node voltage deviation index (TENVDI in Pu) associated with weights. W1 & W2 are weighing factors in which W1 is weightage given to power loss reduction and W2 is weightage given to tail end node voltage improvement. In order to achieve optimal allocation of DG, the objective function ‘F’ is to be minimized so that minimum power loss & maximum tail end voltage improvement is obtained.
3. Genetic Algorithm
Genetic algorithm (GA), proposed by Holland in 1975, is inspired by the natural selection and the law of regeneration and it is one of the most popular evolutionary-based algorithms. The planning programs that finally achieve the convergence criterion are translated into a bundle of chromosomes by encoding and control the search direction by the merits of fitness function [13].
Genetic Algorithm (GA) is direct, parallel, stochastic method for global search and optimization, which imitates the evolution of the living beings, described by Charles Darwin. GA is a part of the group of Evolutionary Algorithms (EA). The evolutionary algorithms use the three main principles of the natural evolution: reproduction, natural selection and diversity of the species, maintained by the differences of each generation with the previous. The GA holds a population of individuals (chromosomes), which evolve my means of selection and other operators like crossover and mutation. Every individual in the population gets an evaluation of its adaptation (fitness) to the environment. In the terms of optimization this means, that the function that is optimized is evaluated for every individual. The selection chooses the best gene combinations (individuals), which through crossover and mutation should drive to better solutions in the next population. One of the most often used schemes of GA is shown in Figure 1 [14].
The steps involved in this GA scheme for optimization are explained below [14, 15]:
1. Generate initial population – the first generation is randomly generated, by selecting the genes of the chromosomes among the allowed alphabet for the gene. Because of the easier computational procedure it is accepted that all populations have the same number (N) of individuals.
2. Calculation of the fitness values of the function that we want to minimize or maximize.
3. Check for termination of the algorithm – it is possible to stop the genetic optimization by:
• Value of the function – the value of the function of the best individual is within defined range around a set value. It is not recommended to use this criterion alone, because of the stochastic element in the search procedure, the optimization might not finish within sensible time;
• Maximal number of iterations – this is the most widely used stopping criteria. It guarantees that the algorithms will give some results within some time, whenever it has reached the extremum or not;
• Stall generation – if within initially set number of iterations (generations) there is no improvement of the value of the fitness function of the best individual the algorithms stops.
4. Selection – between all individuals in the current population are chose those, who will continue and by means of crossover and mutation will produce offspring population. At this stage elitism could be used – the best n individuals are directly transferred to the next generation. The elitism guarantees, that the value of the optimization function cannot get worst (once the extremum is reached it would be kept).
5. Crossover – the individuals chosen by selection recombine with each other and new individuals will be created. The aim is to get offspring individuals that inherit the best possible combination of the characteristics (genes) of their parents.
6. Mutation – by means of random change of some of the genes, it is guaranteed that even if none of the individuals contain the necessary gene value for the extremum, it is still possible to reach the extremum.
7. New generation – the elite individuals chosen from the selection are combined with those who passed the crossover and mutation, and form the next generation.
4. Proposed Methodology
The proposed technique based on multi objective GA for optimal allocation of a DG unit in radial distribution feeder is as follows:
Step 1: Input load data & line data of distribution network.
Step 2: Using forward-backward method of load flow analysis [16], calculate distribution system power loss.
Step 3: Generate initial population of chromosomes with random size and position and set iteration count to zero. Each chromosome is associated with a bus position & real power rating of DG.
Step 4: Fix the maximum limits on DG size and its position. Limit on position of DG depends on no. of buses in test system under consideration.
Step 5: For each chromosome check the bus voltage with specified limits and in any case if it is exceeding limit then the chromosome is infeasible and discarded.
Step 6: For each chromosome, calculate fitness function value which is value of objective function F in present case given in (5).
Step 7: Arrange the objective function values from minimum to maximum and discard the unfit values and retain most fit values.
Step 8: Perform Mutation and Mating operations on retained chromosomes to generate new set of chromosomes.
Step 9: Calculate fitness values of new set of chromosomes generated.
Step 10: Increase iteration count by 1 & repeat step 5 to 9 until iteration count reaches maximum iteration.
The solution obtained after completion of step 10 is optimal solution to the problem. The value of the chromosome at the end includes optimal size & location of the DG for the given distribution system.
5. Results and Discussion
The proposed methodology is tested on IEEE-33bus radial distribution system shown in Figure 2 having following characteristics: Number of buses = 33; Number of lines = 32; Slack Bus no = 1; Base Voltage = 12.66KV; Base MVA = 100 MVA;
The test system is simulated in MATLAB 2008 & the proposed methodology has been tested, whose results are as shown below. The loads are assumed to be peak load.
As per the proposed methodology with 90% weightage given to power loss reduction and 10% weightage to tail end node voltage improvement in multi objective function, the optimal location of DG is found to be bus number 30 with optimal size of 1.7622 MW and 0.8535 MVAR. The result tabulated in Table 2 clearly shows that there is 62.83% reduction in real power loss of system and more importantly there is considerable improvement in tail end node voltage given in Table 1. Hence the proposed method gives better tail end node voltage along with loss minimization as shown in Figure 4, The voltage profile of the distribution system with DG and without DG is shown in Figure 5.
The Genetic Algorithm (GA) parameters used in this proposed DG allocation methodology for test system is shown in Table 3. Each population consists of three chromosomes representing Location, Real power of DG and Reactive power of DG respectively. At each iteration, each population is evaluated for its fitness from (5). After maximum number of iterations specified in Table 5, the optimal solution is obtained.
The performance of the proposed optimal DG allocation method when applied to IEEE 33 bus radial distribution system is compared with the other methods in Table 4. In all the methods, it is observed that the distribution system real power loss is going to be reduced after allocating a DG unit in distribution system. In order to quantify the most effective DG unit, the improvement in the loss reduction is compared with the DG size in MVA injection. This gives loss savings in Kw per Unit DG MVA injection, a better value indicates the allocation results in high loss reduction whereas a poor value of which indicates the allocation results in less loss reduction comparatively.
It is very clear from Table 4 that, the proposed method yields loss reduction of 67.977 KW/MVA DG injection and hence the proposed method tries to bring down the distribution system real power loss to a lower value comparatively and thereby benefits the utility in terms of revenue improvement.
Table 5 illustrates the improvement of critical tail end nodes voltage profile with the proposed method. It is evident that the proposed method provides considerable improvement in the voltage comparatively especially with the bus no 33. The proposed methodology while reducing the power loss of the distribution system with the lesser size of a DG unit comparatively as shown in Table 4, it will improve the tail end nodes voltage profile also.
6. Conclusion
DG interconnection to distribution system provides many techno-economic benefits which depend on its allocation in the distribution system. So siting & sizing of DG is a key issue in planning of Distributed Generation. This paper presents a method based on Genetic algorithm for optimal allocation of a DG unit considering multi-objective optimization function which is combination of power loss reduction & tail end node voltage improvement. It is apparent from the simulation results of GA optimization method that there is significant reduction in power loss & more importantly there is exceptional improvement in tail end node voltage which is a practical problem of many rural distribution system and also critical from the operation point of customer equipments connected to it which face problem of voltage drop very often.
The DG allocation methodology presented in this paper considers the distribution system as a balanced system, but in practical, many of the distribution systems are unbalanced in nature. Also, this optimal allocation methodology is framed for the given load under consideration, but in practical, the load is not constant. Hence, the proposed methodology shall be extended for unbalanced distribution system with variable demand.
Acknowledgement
The author Maruthi Prasanna. H. A. acknowledge the Karntaka Power Transmission Corporation Limited (KPTCL), Karnataka for providing leave to pursue Integrated M.Tech + PhD programme.
Also the authors Maruthi Prasanna. H. A. and Likith Kumar. M. V. acknowledge the Technical Education Quality Improvement Programme (TEQIP-II) of All India Council of Technical Education (AICTE), New Delhi, India and Dr. G. L. Shekar, Principal, The National Institute of Engineering, Mysore, India for providing financial assistance for carrying out this research work.
References
[1] | W. El-Khattam and M. M. A. Salma, “Distributed Generation technologies, definitions and benefits”, Electrical Power System Research. 71 (2004), 119-128. | ||
In article | CrossRef | ||
[2] | T. Ackermann, G. Andersson and L. Soder, “Distributed generation: a definition”, Electrical Power System Research. 2001, 57 (3): 195-204. | ||
In article | CrossRef | ||
[3] | P. Chiradeja and R. Ramkumar. “An approach to quantify the technical benefits of distributed generation”, IEEE Transaction on Energy Conversion. 2004, 19 (4): 764-773. | ||
In article | CrossRef | ||
[4] | G. Pepermans et. al, “Distributed Generation: Definition, Benefits and Issues”, Working paper series, Energy Transport and Environment of K U Lewen Energy Institute, August 2003. | ||
In article | |||
[5] | H. Khan and M.A. Choudhry, “Implementation of distributed generation algorithm for performance enhancement of distribution feeder under extreme load growth”, International Journal of Electrical Power and Energy Systems. 2010, 32 (9): 985-997. | ||
In article | CrossRef | ||
[6] | D.Q. Hung, N. Mithulanathan and R.C. Bansal, “Multiple distributed generators placement in primary distribution networks for loss reduction”, IEEE Transactions on Industrial Electronics, Vol 60, Issue 4, 1700-1708, April 2013. | ||
In article | CrossRef | ||
[7] | R.M. Kamel and B. Karmanshahi, “Optimal size and location of DGs for minimizing power losses in a primary distribution network”, Transaction on Computer Science and Electrical and Electronics Engineering. 2009, 16 (2): 137-144. | ||
In article | |||
[8] | Mithulananthan, T. Oo, L. Van Phu, “Distributed generator placement in power distribution system using genetic algorithm to reduce losses”, Thammasat International Journal of Science and Technology, Vol. 9, No. 3, July-September 2004. | ||
In article | |||
[9] | M. Sedighizadeh, and A. Rezazadeh, “Using Genetic Algorithm for Distributed Generation Allocation to Reduce Losses and Improve Voltage Profile”, World Academy of Science, Engineering and Technology, 37, 2008, 251-256. | ||
In article | |||
[10] | I. Pisică, C. Bulac, and M. Eremia, “Optimal Distributed Generation Location and Sizing using Genetic Algorithms”, 15th International Conference on Intelligent System Applications to Power Systems, Curitiba, Brazil, 8-12 November 2009, 978-1-4244-5098-5/09 IEEE Digital Explore. | ||
In article | CrossRef | ||
[11] | A.A. Abou El-Ela a, S.M. Allama, M.M. Shatlab, “Maximal optimal benefits of distributed generation using genetic algorithms”, Electric Power Systems Research, 80 (2010) 869–877. Ruifeng Shi, Can Cui, Kai Su, Zaharn Zain, | ||
In article | CrossRef | ||
[12] | Dr.T.Ananthapadmanabha, Maruthi Prasanna.H.A, Veeresha.A.G, Likith Kumar. M. V, “A new simplified approach for optimum allocation of a distributed generation unit in the distribution network for voltage improvement and loss minimization”, International Journal of Electrical Engineering and Technology – IJEET, p. no 165-178, Volume 4, Issue 2, March-April (2013). | ||
In article | |||
[13] | “Comparison Study of Two Meta-heuristic Algorithms with their Applications to Distributed Generation Planning”, ICSGCE 2011: 27-30 September 2011, Chengdu, China, Energy Procedia 12 (2011), 245-252. | ||
In article | |||
[14] | “Genetic Algorithms for Optimization – Application in Controller Design Problems”. Andrey Popov. TU-Sofia. 2003. | ||
In article | |||
[15] | Randy. L. Haupt and Sue Ellen Haupt, Practical Genetic Algorithms, 2nd ed., John Wiley & Sons, Inc., Publication, 2004. | ||
In article | |||
[16] | M.H. Haque. “Efficient load flow method for distribution systems with radial or mesh configuration”, IET Proc. On Generation, Transmission and Distribution. 1996, 143 (1): 33-38. | ||
In article | CrossRef | ||
[17] | KashemMA, Ganapathy V, JasmonGB, Buhari MI. A novel method for loss minimization in distribution networks. In: Proceedings of international conference on electric utility deregulation and restruc-turing and power technologies, 2000. p. 251-5. | ||
In article | |||
[18] | Baran ME, Wu FF. Optimum sizing of capacitor placed on radial distribution systems. IEEE Trans PWRD 1989; 4: 735-43. | ||
In article | |||
[19] | Naresh Acharya, Pukar Mahat, N. Mithulananthan, “An analytical approach for DG allocation in primary distribution network”, Electrical Power and Energy Systems 28 (2006) 669-678. | ||
In article | CrossRef | ||
[20] | Wichit Krueasuk, Weerakorn Ongsakul, “Optimal Placement of Distributed Generation Using Particle Swarm Optimization”, In proceedings of the 2006 Australian Universities Power Engineering Conference (AUPEC), Melbourne, Victoria, Australia. | ||
In article | |||
[21] | T. N. Shukla, S.P. Singh, K. B. Naik, “Allocation of optimal distributed generation using GA for minimum system losses in radial distribution networks”, International Journal of Engineering, Science and Technology, Vol. 2, No. 3, 2010, pp. 94-106. | ||
In article | |||
[22] | K. Varesi, “Optimal Allocation of DG Units for Power Loss Reduction and Voltage Profile Improvement of Distribution Networks using PSO Algorithm”, World Academy of Science, Engineering and Technology, Vol: 60, 2011-12-26. | ||
In article | |||