Scribd Logo
Upload

Welcome to Scribd!

  • Optimal Network Reconfigurations in Distribution Systems. I. A New Formulation and A Solution

    Uploaded by

    api-3697505
    8 views8 pages

    Original Title

    Optimal network reconfigurations in distribution systems. I. A new formulation and a solution

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    8 views8 pages

    Optimal Network Reconfigurations in Distribution Systems. I. A New Formulation and A Solution

    Uploaded by

    api-3697505

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 8
    HEE Transco on Powe Deter, Vo: 5. No. 4, November 1990 Optimal Network Reconfigurations in Distribution Systems: Part 1: A New Formulation and A Solution Methodology Hsiao-Dong Chiang, René Jean-Jumeau School of Electrical Engineering Cornell University, Ithaca, NY 14853 Abstract ‘A new formulation of the network reconfiguration problem for both loss reduction and load balancing taking into considerations load constraints and opera tional constraints is presented. The nurmber of switeh- on/switch-off operations involved in etwork teconfg bration is put into a constraint. The new formulation isa constrained, multi-objective and non-differentiable ‘optimization problem with both equality and inequal- ity constraints. A two-stage solution methodology based on a modified simulated annealing technique and the e-constraint method for general multi-objective op- Limization problems is developed. A salient feature of the solution methodology is that it allows designess tofind a desirable, global non-inferior solution for the problem. An elective scheme to speed up the solution ‘methodology is presented and analyzed. Introduction, ‘There are two types of switches in primary distribution systems! normally closed switches which connect ine sections, and normally open switches on the tienes Which connect two primary feeders, of two substations or loop-type laterals. The former are termned section: alisiag stitches and the latter ate referred to as tie ssurtohes (see Fig. 1). These switches ate designed for both protection (to isolate a fault) and configuration management (to reconfigute the network). Network reconfiguration (or feeder reconfiguration) is the process of altering the topologiel structures of distribution feeders by changing the open/elosed sta- tus of the sectionaliing and ti switches (1]. Dus normal operating conditions, an important operation problem in configuration management is network ee- configuration. As operating conditions change, 0 He 6k PMD paper resoneendad end ezpro¥ed Uy the Teik tranastonson and Diatsibation Conc teee Gf the IE Boyer inglovoring Society for presenention the THIG/PED 1990 vntor Footing, Atlanta, Coorglay Beoorber 27, 196% . ° i Figure 1: A sample distribution system networks are reconfigutated for two purposes: (1) to reduce the system real power losses and (2) to relieve ‘overloads in the network. ‘The former is refered to fs network reconfiguration for loss reduction and th latter as load balancing. Another configuration mai- agement operation involves the restoration of service {0 as many customers as possible during a restorative state following a fault. ‘This problem is called service restoration. In this paper, we consider the network recon ration problem for both loss reduction and load bel: ancing. Conceptually, this problem belongs to the so talled minimal spanning tree problem: Given a graph (Ge. nodes of the system), find a spanning t2ee (Le ‘radial configuration ) such that a desiced objective function i minimized while certain system constraints are satisfied. Recently, this problem has been fo Ited as s nonlinear optimization problem with a at ferentiable objective function. All the solution rithms proposed in the literatute for solving the prob- lem employ various techniques belonging to the class of greedy search technique, which accepts only seaech ‘movements that produce immediate improvement. As ‘result, these solution algorithis usually achieve local ‘optimal solutions rather than global optimal solutions. ‘An early work on network reconfiguration for loss reduction is presented by Merlyn and Back 2). Their solution scheme starte with a meshed distribution sy5- tem obtained by frst setting all switches closed and ets. s977p01 10019025000 © 1980 BE then opening successively the switches to eliminate the loops inthe system. Later, the solution scheme Js improved by Shirmoammadi and Hong [In [4], ‘v0 solution algorithms aze presented for network re configuration based on some performance indices to measure the degree of constraint vilations as well as to check the optimality for loss reduction through net work reconfiguration {I}. They derive a simple formula based on some simplifying assumptions to calculate ‘the loss reduction due to a branch exchange, Aoki et al, formulate the problem of both service restoration and foad balancing taking into account eapacity and voltage constraints as a mixed integer non-linear op- timization problem and converts the problem into & series of continuous quadratic prograniming subprob- lems [5,0]. Baran and Wu formulate the problem for less reduction and load balancing as an integer pro- gramming problem [7]. Two efficient load Bow meth ods with varying degree of accuracy ace presented and incorporated into the solution algorithm which follows the approach proposed in (1, The contributions of this paper are summarized as follows. Firstly, in order to truly reflect the objective ‘of load balancing, we propose a system load balan ing index which is a Chebyshev norm of each branch load balancing index. The purpose of load balancing is then realized via solving a min-max optimization problem. Secondly, owing to the fact that these to ‘objective functions - loss reduction and load balancing are incommensurable, we formulate the network recon: figuration problem as a constrained, multiobjective and non-differentiable optimisation problem with both ‘quality and inequality constraints. This isa step t- ‘ward practical formalation ofthe network reconfigura- tion problein. Thitdly, we develop a tworstage solution ‘methodology for genetal multi-objective optimization problems. This new solution methodology allows de signers to find a desirable, global non-nferior solution for the problem. Forth, we present a modified srau- lated annealing technique to solve multi-objective op- Limization problems with the attractive feature that it can yield a global non-inferioe solution eather than just a local non-inferior solution. An effective scheme to speed up the simulated annealing technique is pre- sented and analyzed, Lastly, given a desiced number of switch-on/switeh-off operations involved in network reconfiguration, the proposed solution algorithm ean Identity the most effective operations. In contrast, ‘mest of existing solution algorithms make wse of all of the control variables in solving the problem. ‘This kind of solution is impractical beeause the number of ‘operations could be too large to be executed in actual implementation. Problem Formulation In this section, a new formulation of the network re- Figure 2: One-line diagram of a main feeder with It- eras configuration problem is presented, This formulation is an extension of the problem formulations proposed bby many researchers via truly reflecting the objective of load balancing. Lod Constraints erat er wth 4 ar bapching ot ceo mayrds h na rclgo (erytteatatonsits Sen k Ssufed whey SETS st We mma ts a Sow Satna el, (NS BNE a wo ee eee ee ee IEAM ea fate hare el epee he Bacteria, Ua he tre. (al mca Bethe cada hes ars mole a Reatnpeltacee oer teed densa bats cea poe anes a eo, in pec he el aad vette for Bolg ane et Ge Wie ada te sel an be ‘aprassed By the following fecuante set of equations Pare a nate ri Big 7 Qian = @ = en EE — ur a We = WP = 2h + ange + 2 oa ft @ 7 a + at « Equations (1) (2, called the branch Row equation, can be wnitten in compact form Xen = fn) w where X: = (2, Qi, [MPP] The Branch flow equations at ranching node K ofthe main feeder can then be wetien Pu = PalXoes) ~ Po 6 Qu = QualXenns) ~ Que 6) Wo = Veal Xeeon) “These are severl boundasy conditions to be sais: 1. atthe substation; the voltage magoitude [Voli spec ite 2, a the end of the main foster, Phu = Po Xon-t} = 0 ated Qon = Qon(Xon-1) 3. atthe end of lateral k; Pag = 0 and Qu Foc this system (one main feeder with one lateral), since the substation voltage magnitude i specie, knowing the ‘atiables (Po, Quo, Pa, Qua) i sufcient to determine the fest ofthe system variables, We ow conser a general radial dstibution system

    You might also like