Abstract
Distributed Generation (DG) using renewable technologies is increasing due to their benefits including energy security and emission reduction. However, installing new DGs in distributed networks is limited due to network constraints such as feeder capacity and short circuit level, as well as higher investment costs. In this paper, network reconfiguration and reactive power planning are used to maximize DG penetration level and to minimize annual loss for DGs with biomass technologies. In order to model the problem uncertainties, 96 scenarios considering ten different network load levels are studied. A multi-objective method is applied for solving this optimization problem by using Pareto front. The numerical results indicate the positive impacts of the proposed approach on improving the network security.
You have full access to this open access chapter, Download conference paper PDF
Similar content being viewed by others
Keywords
- Annual loss
- Biomass
- DG penetration
- Network reconfiguration
- Pareto front
- Reactive power planning
- Renewable energy
1 Introduction
Environmental concerns, such as global warming causes that renewable energy, e.g., biomass, play an important role in supplying energy [1]. The planning of distribution systems is a critical issue that the system planners faced with [2]. In one hand, appropriate placement of DGs in the distribution systems has an essential role in the enhancement of the system efficiency; consequently finding the optimum placement of DGs is critical [3]. On the other hand, a large number of researchers have focused on the reactive power planning in the distribution system, especially when it has have high-penetration of renewable resources DG [4].
In this sense, network reconfiguration is a method to change the topology of branches through altering the open and close statuses of sectionalizing and tie switches [3]. This can be carried out in different seasons of a year to reduce the total loss and increase the system reliability.
For instance, as reported in [4], a DG planning was proposed for the coordination of reconfiguration of feeders and voltage controlling with the goal of maximizing the DG capacity at a specific bus.
In the current work, it is planned biomass DG for four different scenarios. In the first scenario, the annual loss is minimized without considering network penetration. The second scenario represents minimized annual loss considering network penetration. In the third scenario, network penetration is maximized, and finally, in the fourth scenario, a multi-objective problem is provided that minimizes the annual loss and maximizes the network penetration.
2 Relationship to Smart Systems
Distributed Generation (DG) of electricity using renewable technologies is increasing due to their benefits including energy security and emission reduction [5]. Smart grid can be defined as a contemporary structure of electricity systems to improve effectiveness, reliability, and safety, via integration of sustainable energies, as well as automated and intelligent controlling and advanced communications technologies [6, 7]. It affects entire parts of power systems, and consequently it needs a widespread data communication structure [8].
Importantly, smart grid allows modern network controlling schemes and provides operative integrated DGs in the demand side [9, 10]. Smart Grid will have a significant role to support high penetration level of DGs; nevertheless, the existing standard/code leading DGs’ interconnection does not allow implementing various applications that can be advantageous for the system [11]. Novel approaches for utilizing the data in the supervisory controllers would be required, as well as an environment in which tools could be emerged in online stream event processing.
3 PSO and MOPSO Algorithm
The particle swarm optimization (PSO) applied in optimization techniques; it was inspired from the movement migration of population species that lives grouped [12]. The elementary philosophy behind PSO is that each individual from the swarm, hereafter called as particle, uses the information from the swarm, based on the knowledge, sharing, and historical information to find its survival means. Computationally, PSO process starts with a random swarm of particles delimited from delimited universe, where each particle, from the movement process, will be a momentary solution of the problem with tuned fitness rate. The aforementioned fitness is computed and optimized in each iteration. The movement rule, defined by a position and velocity, defines the direction, speed, and position of the swarm to reach the optimal and are updated in each iteration. In this process, the particles interact with each other and them they move from the delimited universe till reach the best solution (the optimal from the optimization process). Both, position and velocity are updated them from the experience from the past position and velocity and the best position found from the swarm. Computationally, the aforementioned description can be expressed:
Where \( X_{p}^{iter} \) is the last position of a particle p from iteration iter that may express the best result to the optimization problem. By other words, and specifically in DG optimization problem, \( X_{p}^{iter} \) is a set of DG decision variables and \( V_{p}^{iter} \) is the velocity from particle p from iteration iter. Moreover, \( X_{g,best}^{iter} \) is the best global position g found from the swarm in iteration iter. So, the movement direction of the swarm is dependent by the influence, respectively, from \( V_{p}^{iter} \), and \( X_{g,best}^{iter} \) [13]. By other words, the swarm movement is strictly influenced by the inertia, memory and cooperation of the swarm, expressed by the three term of (2). However, for the multi-objective problem of DG optimization proposed in this work the original PSO strategy is modified. The original goal to find a unique solution is then turned in one new array of multiple solutions, based on Pareto strategy to solve the multi-objective DG problem [14, 15].
4 Formulation
The planning model aims the minimization from the yearly energy loss and maximizes network penetration in the distribution system for all possible loads. Time segments are represents in sets of 90 h (i.e., the number of days for each season). Moreover, in (3), g represents as load states, and \( P_{loss} (g) \) represents energy loss at (g) load state. Furthermore, in (4), C m represents biomass capacity installed at each candid bus (CB).
Subject to:
Active and Reactive power balance:
In (5) and (6), \( LP\left( g \right) \) represent load peak level that shown in Table 1. \( V_{g,i} \) represents voltage magnitude at load level g. \( P_{D,i} \) and \( Q_{D,i} \) represent active and reactive demands, respectively.
Slack Bus Constraints:
Voltage Constraints at the Other Buses:
where V min and V max are 0.95p.u and 1.05 p.u respectively.
Feeder Capacity Limits:
DG Penetration. To this end, it has 2 different type of DG penetration in DG planning. (11) represent DG penetration for candidate bus. This limitation depends on the land and protection level of the candidate bus. In this paper, it is assume this limitation at 1200 kW. (12) limit installed DG capacity in the whole network. This limitation assumes to be 1200 kW too. (12) just consider in the 3rd scenario.
5 Numerical Results of the Model
The PG&E 69bus distribution test case [16] has been considered to implement the proposed model. In normal operation, disregarding DGs, the yearly energy loss is 199.5 MWh. The slack bus of the system is node 1. The candidate bus for installing DG is CB = {20, 46, 49, 50, 53}. Total active and reactive demands are 3802 kW and 2695kVAr, respectively. The 69bus case study is also presented in Fig. 1. Implemented DG in the network is biomass resources with the controllable output. The hourly demand is represented in Table 1 as a proportion of the yearly demand peak. The proposed planning problem is applied to 4 scenarios with different constraint and objective function. Outcomes are represented in Table 2. Based on the results, if it is added DG, penetration constraint to an optimization problem, annual loss would increase.
Another effect of adding this constraint is that it is not possible to control voltage bus within 0.95 to 1.05 per-units (p.u). In this scenario, the buses voltage is varied from 0.9 to 1.1. In the third scenario, it is maximized DG penetration without violation any constraints. In this case voltage limit is 0.95 < V < 1.05. In the fourth scenario is planning biomass DG with two objective functions. Pareto optimal front found by the algorithm is shown in Fig. 2. In this scenario voltage limit will be in 0.95 to 1.05 p.u.
TOPSIS algorithm is implemented to find the best decision for the decision maker. The theory of this algorithm is represented in [17]. The answers are represented in Table 3. It is used three different set of weight factor for objectives. Weight factors are {(0.2, 0.8), (0.5, 0.5), (0.8, 0.2)}. The Pareto front for a scenario is shown in Fig. 3.
6 Conclusions
In this work a multi-objective model was presented for the distributed generation planning and solved the formulated problem with PSO algorithm. DGs were biomass with controllable output, although the proposed strategy could just tackle several types of uncertainty from wind or solar energy, for instance. Annual loss minimization and DG penetration maximization were considered in this paper. After determining the Pareto front, it was used TOPSIS method to choose the best decision for the decision maker. The numerical results showed that considering only the DG penetration constraint increased the annual loss. In addition, by adding this constraint, the voltage bus could not be constrained between desired amounts. However, the proposed approach considering both DG penetration constraint and annual loss could significantly improve the effectiveness of the DG planning.
References
Atwa, Y.M., El Saadany, E.F.: Probabilistic approach for optimal allocation of wind based distributed generation in distribution systems. IET Renew. Power Gener. 5, 79–88 (2011)
Arefifar, S.A., Abdel-Rady, Y.I.M.: Probabilistic optimal reactive power planning in distribution systems with renewable resources in grid-connected and islanded modes. IEEE Trans. Ind. Electron. 61(11), 5830–5839 (2014)
Atwa, Y.M., El Sadaany, E.F., Salama, M.M.A., Seethapathy, R.: Optimal renewable resource mix for distribution system energy loss minimization. IEEE Trans. Power Syst. 25(1), 360–370 (2010)
Su, S.-Y., Lu, C.-N., Chang, R.-F., Gutiérrez-Alcaraz, G.: Distributed generation interconnection planning: a wind power case study. IEEE Trans. Smart Grid 2(1), 181–189 (2011)
Gungor, V.C., Lu, B., Hancke, G.P.: Opportunities and challenges of wireless sensor networks in smart grid. IEEE Trans. Ind. Electron. 57(10), 3557–3564 (2010)
Cecati, C., Citro, C., Siano, P.: Smart operation of wind turbines and diesel generators according to economic criteria. IEEE Trans. Ind. Electron. 58(10), 4514–4525 (2011)
Arasteh, H., et al.: IoT-based smart cities: a survey. In: Proceedings of 2016 IEEE 16th International Conference on Environment and Electrical Engineering (EEEIC), Florence, pp. 1–6 (2016)
Kamyab, F., Amini, M.H., Sheykhha, S., Hasanpour, M., Jalali, M.M.: Demand response program in smart grid using supply function bidding mechanism. IEEE Trans. Smart Grid 7(2), 1277–1284 (2016)
Palensky, P., Dietrich, D.: Demand side management: demand response intelligent energy systems and smart loads. IEEE Trans. Ind. Inform. 7(3), 381–388 (2011)
Calderaro, V., Hadjicostis, C., Piccolo, A., Siano, P.: Failure identification in smart grids based on Petri net modeling. IEEE Trans. Ind. Electron. 58(10), 4613–4623 (2011)
Bahrami, S., Sheikhi, A.: From demand response in smart grid toward integrated demand response in smart energy hub. IEEE Trans. Smart Grid 7(2), 650–658 (2016)
Couceiro, M., Ghamisi, P.: Fractional Order Darwinian Particle Swarm Optimization Applications and Evaluation of an Evolutionary Algorithm. SpringerBriefs in Applied Sciences and Technology, 2nd edn. Springer, Heidelberg (2016). p. 75
Soroudi, A., Afrasiab, M.: Binary PSO-based dynamic multi-objective model for distributed generation planning under uncertainty. IET Renew. Power Gener. 6(2), 67–78 (2012)
Devi, S., Agade, A.K., Dehuri, S.: Comparison of various approaches in multi-objective particle swarm optimization (MOPSO): empirical study. Stud. Comput. Intell. 592, 75–103 (2015)
Santos, S.F., et al.: Novel multi-stage stochastic DG investment planning with recourse. IEEE Trans. Sust. Energy 8(1), 164–178 (2016)
Baran, M.E., Wu, F.F.: Optimal capacitor placement on radial distribution systems. IEEE Trans. Power Deliv. 4(1), 725–734 (1989)
Eldurssi, A.M., O’Connell, R.M.: A fast nondominated sorting guided genetic algorithm for multi-objective power distribution system reconfiguration problem. IEEE Trans. Power Syst. 30(2), 593–601 (2015)
Acknowledgment
This work was supported by FEDER funds through COMPETE 2020 and by Portuguese funds through FCT, under Projects SAICT-PAC/0004/2015 - POCI-01-0145-FEDER-016434, POCI-01-0145-FEDER-006961, UID/EEA/50014/2013, UID/CEC/50021/2013, and UID/EMS/00151/2013. Also, the research leading to these results has received funding from the EU Seventh Framework Programme FP7/2007–2013 under grant agreement no. 309048.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 IFIP International Federation for Information Processing
About this paper
Cite this paper
Najafi, S., Shafie-khah, M., Hajibandeh, N., Osório, G.J., Catalão, J.P.S. (2017). A New DG Planning Approach to Maximize Renewable - Based DG Penetration Level and Minimize Annual Loss. In: Camarinha-Matos, L., Parreira-Rocha, M., Ramezani, J. (eds) Technological Innovation for Smart Systems. DoCEIS 2017. IFIP Advances in Information and Communication Technology, vol 499. Springer, Cham. https://doi.org/10.1007/978-3-319-56077-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-56077-9_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56076-2
Online ISBN: 978-3-319-56077-9
eBook Packages: Computer ScienceComputer Science (R0)