Loads Combination Method Based Core Schema Genetic Shortest-path Algorithm For Distribution Network Reconfiguration Yixin Yu, Senior Member, IEEE, and Jianzhong Wu Absract~A novel dstibuti algorithm, ork reconfiguration sed Core Schema Genetic Shortest path Algorithm Proposed ia this paper. It x bared on the loads ‘one using shortest path algorithm, end forming a core schernt chromosome using core schema algorithm (CSA) (2) searching Possible core schema chromosomes for the optimal one using Elobal optimization method ~ genetic algorithm. CSGSA te ased for solving the less minimum reconfigaration problem, and ig capabiliy Is greatly improved by using. Proposed branch weight formolation, which sonsiers the effect, ‘of residual branch capacities; CSGSA ls also employed 0 soe ‘the supply restoration problem and promising results have been obtained. The propated method ean be used as am efficent fol for distribution network lost minimization and. supply Index Terms--Disuibation network reconfiguration, genetic algoidh,shortest-path algerlthm, restoration 1 rereooucrion DSTRBUTION nerwr reconfiguration is the proces of tering the topological structure of distribution network by changing the oper/closed status of the sectonalizing and tie switches. Networks are reconfigured for thre purposes: (I) to reduce the power lsses for cuting down the operating cost, (2)to relieve overloads inthe network and (3) to restore power rapidly to as many customers as posible. (1) and (2) are used during normal operating conditions, and (3) is employed during a restorative state following a fault. Tence ‘reconfiguration is very important work to reduce distbution| feeder losses and improve system security Distribution network reconfiguration problems ate large-scale, multi-objective, nonlinear, _ mined-nceger combinatorial optimization problems that belong to NP hard problems. They have been widely studied from 1980's. A. ‘umber of techniques have been applied to these problems They fall broadly ito three categories: (I) methods based upon ewistic search pattems (1}(4]. Most of them do branches (or switches) combination using heuristic rules 10 This work vo ply spor by de Naot Nasa Sle Sndaton of Cina (Gat Nutr. 987701) a the Reser ud fo ‘Dacor! Progam of Higher aceon Gr Number S000) ‘Yin nd nang we ton hte Scheel of Beri Exgiomrng. Thmin Unveny Tan 300072 Re Chine fo RUMI and wes) 0-73on-7s9-200700 6 2002 EE form radial networks. The chief advantage ofthese methods is that they can compute very fast, and the disadvantage is that, the quality of solutions completely depends onthe initial state of the system and there is no guarantee ofa strictly optimal solution; 2) methods based upon mathematical programming [5]. The chief advantage of them is thatthe problem (including constrains) can be adequately formulated, and these methods ‘ean be applied to any network configuration and does not rely ‘on specific knowledge about a network. They ean aso find a9 ‘optimal solution, given & particular objective function and a set of constraints. The disadvantages associeted with these methods are as follows: (a) itis difficult to formulate the reconfiguration problems in terms ofan objective function and constraints, suitable for solution using »malhematicel programming, (6) computation time has been unacceptable for large system: (3) methods based upon anfcial intelligence techniques. Some of them are of poor generality and can only deal with small-scale networks [6}(7], some can hardly control their parameters and there i a great disparity between practical implementations andthe theoretic results [S119 and Some have unacceptable computation burden {10}. For these reasons the large-scale distribution network reconfiguration problems have not bean well resolved, In this paper, an effective global optimization for large-scale distribution network reconfiguration problems, named core schema genetic shorest-path algorithm (CSGSA} is proposed, CSGSA follows the ides of [10} changing frm branches (or switches) combination 10 loads combination CSOSA hus a powerful global searching capability, and can converge at the global optimums rapidly by using Core schema algorithm (CSA) proposed in this paper. CSGSA is employed fo solve the supply restoration problem a¢ well as the reconfiguration for loss minimization, and. promising results have been obtained 1, Aucorrmim Descrurtios ‘A. Loads Combination Method Based Distribution Network Reconfiguration Problems Let G be the non-orented graph ofa distribution network, PS {pu ~, pa) denotes the set of all power sources, BS‘ {by by} the set ofall branches, LSE (ff) the set ‘ofall oad nodes, and NLS (nl, la the set of all noncload odes, where Kis the mumber of power sources, m the number of branches, m the number of load nodes and h the number of onload nodes, Iisa fact that ~1729-G = PSUBSULSUNLS ® Most of exiting methods work on BS for ining a subst {BSCS in which branches form radial networks, and these methods are called branches combination based. methods. Loads combination based configuration methods work on LS instead of BS: fist of all, aanging all elements in LS and forming. loads sequence Sy and then searching for the ‘optimal power supply path for each load Ly€ LS, Fl, , m tcording to the order of loads in S, and finally obiaining radial networks. ‘There are tree Key Factors in loads combination method based distribution network econfigration problems: (1) How to determine the order of loads in Sy (2) How to find a power soppy path foreach load, and (3) How to search forthe soba optimus, B. Architectre of CSSA CCSGSA forms loads sequence S, by arranging the loads randomly, finds appropriate power supply path for cach load Using shortest-path algorithm, and searches fr the optimal fads sequences using geneie algorithm. Details of the algorithms architecture areas follows: (1) Amanging all clements in LS and forming P lndependent loads. sequences Syn Syn > Syp to be P chromosomes of genetic algorithm, where P'is also. the population sizeof genetic algorithm (@) Foreach Sp =I, =P: Step 1! Changing from non-oriented graph G to oriented saraph Gey [10], which is used bythe shortest-path lgorithm ‘Step 2: Searching forthe power supply paths forall loads in S, one by one using shortest-path algorithm and modifying Gig! moving branches capacities, modifying in-aresrumber ofeach node to avoid forming a lop with the existing power Supply paths, and guaranteeing satisfaction tall constraints. Step 3° Wiping out the coresponding non-core-schema Foads in Sy using core schema algorithm (CSA) and forming core scheme chromosome 5, gradualy. (G) Working on the core schema chromosomes using ‘genetic algorithm, and searching forthe global optimus. Because CSA’ has been mentioned above, the idea ‘principle and correlative concepts of CSA willbe introduced bien Tes found out that £5 can be divided into two subsets according to the order of loads in Sy, we have 1S = 1S ULSiy ® Sg A ISiy = 6 ° Where loads in LS," are called careschema loads and they play a key role during the process of obiining the final hetwork configuration. Loads in 1Sej”" ate called non-core-schema loads and they can influence some loads in Sen which have not yet searched far their power supply paths, by changing branch weights in Gy 30 they sill have effect on obtaining the final network configuration, but this effect is secondary. For example, searching forthe power supply path of load dyin ye and path P, willbe obtained. Assuming that Las, bg 8 te loads along path Pr, whose power supply paths have not be searched for yet. In fact, L, as determined their power supply paths eccordng to the radial constraint, 1S, ® Lass lag € LS o ‘The main use of CSA is to divided LS imo LS’ and Sq” during the process of searching for the power supply paths of Sy, so as to give prominence to the effect of fore-schema loads and weaken the effect of non-coreschema Toads, When 2 coreschema load has found is power supply path, CSA will put corresponding non-core-schema load into ‘Gog and change relevant necwork parameters. At the same time, ‘anew chromosome named core-schema chromosome denoted by Sy" is coming imto being. The structure of Sy which is used for eplacing Sy i defined as follows: SE Lye gli Lay © Where Lye sby € Sey o Lge sbyy € LSig ® The fren of Sy is composed of eore-scheme loads, the rear nd is composed of non-coreschems loads, and the oder of Toals is detzmised by their coresponding order in Sy Generally, the number of eareschema loads 7 i quite fever than the number of non-core-schema loads f,s0 CSOSA ean ‘obuin a fina nenerk coniguaon by searching for power Supply paths for ony loads CSA is based on the Schema Theorem that sone ofthe mathematical foundations of Genetic Algorithm. The Schema ‘Theorem suagests that the shor defining length, low order, above average fitness schemata receive exponentially incresiog tals in. subsequent generations of geneic algorithm. Whete the order of a schema is the number of ronsvldeat genes. The defining length of a schema isthe distance between the first and he ast non-wildeat genes and it ‘represent the compactness of «schema TECSA is no weed, the loads in Span ES” wil mix together (0 form Sp. and loads searched for power supply paths earlier will ave peat impact on the loads dealt with Fete ‘That isto sy, the foads are clase coupling. Chromosomes formed by this way have high schema order and Tong schema defining length, so they are not suitable for genetic operations. IFCSA is used, genetic operators work on 5," instead of Sy. Equation (6 has shown he structure a Sy the schema ofS, ea be represented a i Sy aT he o Where the asterisk is the wildcat symbol Ics obvious that this kind of chromosomes will be of low schema order and short defining length, and fherore, there. is no need 10. search for” power supply path of non-coreschema load using the shotespath alporin, ch that the global optimums can be obtained ‘wih ligher ‘computation burden . Solving the Distribution Network Reconfiguration Problems Using CSGSA (1) Reconfiguration fr Loss MinimizationCSGSA is used for solving the distribution network reconfiguration problem for 105s minimization, and the objectives 9S P 9 a Where Pi iste active power loss on branch &, € BS. At the same tie, the result network must subject toa number of| constrains: radial configuration; all loads are served; lines, transformers and other equipments are within curent capacity limit, and voltage magnitudes are within limit, ee ‘When using the shortestpath algorithm to search for power supply path, loads dealt with earlier will ave great tempacton the loads dealt with later by changing some branch Weights in Gig. Especially in CSA, when a power supply path has been obtained, all non-coteschema loads along this path will be added into Gsyat one time, so the correlative branch ‘capacities will increase grestly and the probability of obtaining ‘no power supply path will increase too. Thus it is necessary 10 consider the effect of residual line capacities during the searching process For exerting the advantages of CSA, a corresponding simple formulation of brafich weight considering the effect of residual capacities of Fines is presented, and this formulation can be expressed a follows: a a, Where Wy APron yy Uyand fy are the weight, loss increment, capacity upper lit, and capacity af branch 6, there is no load an branch 6, then fy°0, WAP that is to say the shortest path algorithm will choose power supply path according tothe lss inerement. I residual branch capacity is lacking, the branch weigh will be very lege, and there is Hite probability that the branch to be chosen. Ifthe residual branch capacity i , the branch weight willbe infinite, and this branch is equal to be wiped off from Gy. Generally, branch with comparatively smaller loss inerement and larger residual capacity wil have lager probability of being chosen, (2) Reconfiguration for Supply Restoration CSOSA js also employed to solve the supply restoration problem. Thece are some definitions: If there are some faults ‘curred in the distribution network and the faults have been isolate, the distribution network is divided into fault areas, service areas and out-oftervice areas) The fault areas are ‘composed of fault components, the service areas ate the areas ‘keeping power supply that are not influenced bythe faults, and the out-of-service areas azo formed after the faults isolation with no power supply and no faults. The tie lines connecting of-service areas and service areas ae called boundary tie lines and the corresponding switches. are called. boundary switches “The main objective of supply restoration is to restore ax many loads as possible by transfering. de-energized loads from the outotservice areas to service areas via network reconfiguration, but at the same time respecting all of the constrains. Another important aim isto minimize the network Joss and the operational costs forthe reconfiguration Thee factors are taken into account in the objective of the proposed restoration algorithm: (1) Loss of load ~ the demand that cannot be supplied ‘eeause the conesponding parts of the network are not connected to @ source or load has to be shed to meet some constraints; (@) The feeder losses in network; {G) Switch operation cost, In shor, the proposed restoration algorithm is to find restoration seheme with minimum economic loses, while ensuring that-all of the constrains. are met. The objective function is defined as: min feoPittoPat oC, (12) Where: ‘us the cos ofl lost loads within time unt, hence FLOP «3) Pu, is a lost load (KW), and «18 the corcesponding power pice (YuankW). Phzis the cost of the network ative power losses within time unt, hence Po = Or Piass 04) Paiste network active power losses (kW), and 4. is its price (Yuan/kWh), Gy is the cost of operating switches from the intial network state to the final state (Yuan); 5 length ofthe time period (Hour). And 1, «are the weights "The proposed restoration algorithm is presented as fallows: Step 1: Dividing the distribution network into faut areas, service areas and outofservice areas by using the ‘coloring up algorithm, Step 2: Employing CSGSA to search for optimal power supply path foreach outof service lad ‘Step 3: If there are some Toads that can not find feasible paths, load shedding strategy Is caried out using special gone “STOP”, of adjoining ares expanse algorithm is employed for recalculation, The detils are as follows: (1) [Load Shedding gene “STOP”. tn some cases that fll supply restoration is impossible, some loads must be shed 19 meet cetain consrans. To solve this problem, a special gene ‘STOP" is itroduced into the chromosome. The “STOP” gene is different from the other genes in that i is only lag (Gnstead of denoting one load). Before the “STOP” gene inthe chromosome, all loads will search for thir optimal power Supply paths, and beyond the “STOP” gene, all remaining loads are shed. For instance, chromosome (3,1, 0, STOP, 2) will only allow loads represented by (3, 1,0) to search for their power supply paths, “STOP” is a Stop sign and keeps load 2 out of service. In the initial population, the "STOP" gene i located atthe end ofeach chromosome. i load can't find a valid power supply path, it will be put behind the “STOP” gene, thus i is expected that the "STOP" gene will rapidly evolve to somewhere near the end ofthe chromosome after a few generations evolution, 2) Adjoining area expanse algorithm. The proposed supply restoration algorithm is to featch for power supply path for each outaf-service load by closing boundary switches and atthe same time closing of ‘opening switches in ouvofeservce areas. It is possible that ‘operating only on the boundary switches and switches in the a17381-