Sei sulla pagina 1di 4
Distribution Network Reconfiguration for Reliability Worth Enhancement YE Bin, WANG Xiu-li, BIE Zhao-hong, WANG Xi-fan Abstract-Am approach to increase customer reliability worth by network reconfiguration is propoted in this paper. Firstly, hey eostwarth model of distribution system and the alla tchaique are Introduced; thea (he careesponding mathematleal mndel ia which the objective function ito minimize customer interruption costs is ‘constructed, and an improved genetic algorithm x introduces (0 the wetwork optimization that searches the global optimal Solution, Based on the presented model and algorithm, the ‘computational program and validity of the suggested method. Finally, in comparison wlth the reconfiguration aiwing at improving system reliability, ‘ome sonclasons can Be obtained. |. ermopucrion ETWORK reconfiguration is an important measure to improve the operation performance in a distibution system, The purpose of the network reconfiguration is not only for decreasing network loss and balancing system load, but ako for insolating fault and restoring service Therefore, network reconfiguration can be used t0 promote economic’ results, liability and voltage qualities of , and mutation probability pare the key factors determining the ‘behavior and performance of algorithm, and directly affect the asringency. For the purpose of making the heredity ‘operation have cerain ability of getting rid of local optimal, this paper adopts the measure in [5], and determines the erosover probability and mation probability lows p. = 0.9-O:4xnGen/ MaxGen © P,, = 0.140.3%nGen/MaxGen o Where Gen is the current generation of the heredity, -MaxGen isthe total generations 5). The troduction of Simulated Annealing Algorithm In view of the phenomena of GA thst prematurity easily appears at early stage and evolution often salsa late stage, Paul L.Stoffa presented the Simulated Annealing Genetic Algorithm (SAGA) in reference of the idea of simulated annealing, the algorithm can pl the fitness of individuals 2s the follwing method: a Lee ® Ser T =7,(0.99*") oy Where f, i the fines of the iy individual, M is the population size, g isthe euret population, T isthe current temperature, Tis he ini temperatre 6), Feasible soltion judgement Because the obtained solutions in GA cant be sure 10 satisfy the constraints of the objective fanction, the Jgement tothe feasbitity of « cromosome hs to be added inthe algorith. IV, Tie ANALYSIS OF Conurarion “There are 22 load points and 12 switches in 1EEE-RBTS ‘bus 2 system, and the number of connect swches is 2 (he fith and the tell). The network configuration and the coding of the switches ofthe system are shown in Figure | There are four ypes of customer: esiental, commercial, soll industrial and governmenvinsitonal A ompuationl program which uses the described analytical technique and Ga has been developed. I the computation to thesstery the population size is selected be 20,and_ the heredity generation i 20 to, the opima solution i obtained when the program runs tothe 12" generation. Finally, the system relbiltycoa/wor indices are shown in Table Tl In Table I, scheme 1, 23 are the optimal and suboptimal solutions of the reconfiguration that aims at obaining the least system ECOST, scheme 0 corresponds tothe initial rerwork configuration. Tt canbe seen that network reconfiguration achieves the objective that makes the system EECOST be the least, and the system elabilty worth be the largest. At this time the customers of the network can obiin the lngesteconomie benefits, LPIGLPI7 Lee LPI9 LP20LP21 LPa2 IPI LP2 133 LP# Les ip6. Cpr As known, the reconfiguration aiming at improving system reliability indices has been often studied, the common indices are EENS, ASAI, ASUI, et. In order 19 compare, the author reconfigures the sme system while make EENS the lest as the optimized aim, and the obtained solutions are shown in Table I ‘Comparing Table 1 with Table TH, we can sce that when ENS isthe least, the corresponding ECOST isn the leat. It rakes clear that in despite of the reliability of the system being the highest, while the benefit brought to customers is not the largest; inthe meanwhile, the corresponding expected energy not supply is aso not the least when the reliability ‘worth of the system achieves the largest value ts caused by the various SCDFs of various types of customers connected to the network. For advanced analysis, the liability costworth indies of some load points corresponding to the ‘optimal schemes in Table I and I ae shown in Table LV. T-can be seen distinetly from Table IV thatthe EENS of LLP4 and LPG in scheme A are larger than the ones in scheme B, while the ENS of LP2 is ess than the one in B. It can also be seen fiom Table [thet in the same outage duration the imeruption loss ofthe industrial is much larger than the ones ofthe governmertnsitutional andthe commercial. It means that scheme A assures the interruption energy of the load points of which the SCDF is large as lite as possible in priority, and the relative interruption cost is litle too, so the system ECOST achieves the least vale; itis only considered that the- interruption energy of each load point is litle in Scheme B, assuring the system BENS obtains the least value, “while the types of customers are not considered. Inthe envionment of market, utilities are firstly concerned about bringing. the largest possible economic Benoit to customers at certain reliability level, so during the course of designing distribution network, processing the system ~2540-

Potrebbero piacerti anche

  • Kalay Atway - Add Say
    Kalay Atway - Add Say
    Documento133 pagine
    Kalay Atway - Add Say
    api-3697505
    Nessuna valutazione finora
  • Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    Documento5 pagine
    Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    api-3697505
    Nessuna valutazione finora
  • 01349721
    01349721
    Documento4 pagine
    01349721
    api-3697505
    Nessuna valutazione finora
  • 01509819
    01509819
    Documento4 pagine
    01509819
    api-3697505
    Nessuna valutazione finora
  • Ba Luu Doe' Ywar (U Thaung)
    Ba Luu Doe' Ywar (U Thaung)
    Documento126 pagine
    Ba Luu Doe' Ywar (U Thaung)
    yeyint
    Nessuna valutazione finora
  • Historyof Mankind
    Historyof Mankind
    Documento162 pagine
    Historyof Mankind
    api-3697505
    Nessuna valutazione finora
  • 01356300
    01356300
    Documento5 pagine
    01356300
    api-3697505
    Nessuna valutazione finora
  • 01348243
    01348243
    Documento4 pagine
    01348243
    api-3697505
    Nessuna valutazione finora
  • 01343686
    01343686
    Documento5 pagine
    01343686
    api-3697505
    Nessuna valutazione finora
  • 01338515
    01338515
    Documento4 pagine
    01338515
    api-3697505
    Nessuna valutazione finora
  • 01347595
    01347595
    Documento5 pagine
    01347595
    api-3697505
    Nessuna valutazione finora
  • 01338518
    01338518
    Documento6 pagine
    01338518
    api-3697505
    Nessuna valutazione finora
  • 01347592
    01347592
    Documento6 pagine
    01347592
    api-3697505
    Nessuna valutazione finora
  • 01338470
    01338470
    Documento7 pagine
    01338470
    api-3697505
    Nessuna valutazione finora
  • 01338070
    01338070
    Documento6 pagine
    01338070
    api-3697505
    Nessuna valutazione finora
  • 01338475
    01338475
    Documento6 pagine
    01338475
    api-3697505
    Nessuna valutazione finora
  • 01338460
    01338460
    Documento4 pagine
    01338460
    api-3697505
    Nessuna valutazione finora
  • 01338078
    01338078
    Documento6 pagine
    01338078
    api-3697505
    Nessuna valutazione finora
  • 01338041
    01338041
    Documento6 pagine
    01338041
    api-3697505
    Nessuna valutazione finora
  • 01338466
    01338466
    Documento5 pagine
    01338466
    api-3697505
    Nessuna valutazione finora
  • 01338076
    01338076
    Documento4 pagine
    01338076
    api-3697505
    Nessuna valutazione finora
  • 01338068
    01338068
    Documento6 pagine
    01338068
    api-3697505
    Nessuna valutazione finora
  • 01338074
    01338074
    Documento6 pagine
    01338074
    api-3697505
    Nessuna valutazione finora
  • 01338048
    01338048
    Documento5 pagine
    01338048
    api-3697505
    Nessuna valutazione finora
  • 01337997
    01337997
    Documento6 pagine
    01337997
    api-3697505
    Nessuna valutazione finora
  • 01309843
    01309843
    Documento9 pagine
    01309843
    api-3697505
    Nessuna valutazione finora
  • 01338007
    01338007
    Documento6 pagine
    01338007
    api-3697505
    Nessuna valutazione finora
  • 01338030
    01338030
    Documento5 pagine
    01338030
    api-3697505
    Nessuna valutazione finora
  • 01007714
    01007714
    Documento5 pagine
    01007714
    api-3697505
    Nessuna valutazione finora