performance evaluation of swarm intelligence based power system ...

More documents

Recommendations

Info

sk : current searching pointski': modified searching pointV' : current velocityvk": modified velocityV,k,, : velocity based on pbestVgbelt : velocity based on gbestFig. 2.1. Concept of modification of a searching point by PSOFig. 2.2. Searching concept with particles in a solution space by PSOThe equation (2.7) is used to calculate the particle's new velocity according toits previous velocity and the distances of its current posltion from its own bestexperience (position) and the group's best experience. Then the particle flies towardsa new position according to (2.8). The performance of each particle is measuredaccording to a predefined fitness function, which is related to the problem to besolved.The step by step procedure of PSO algorithm is given as follows:I. initialize a population of particles with random values and velocities withinthe d-dimensional search space. Initialize the maximum allowable velocitymagnitude of any particle Vmax. Evaluate the fitness of each particle and assign
the particle's position to pbest position and fitness to pbest fitness. ldentify thebest among the pbest as gbest.2. Change the velocity and position of the particle according to equations (2.7)and (2.8). respectively.3. For each particle, evaluate the fitness, if all decisions variables are within thesearch ranges.4. Compare the particle's fitness evaluation with its previous pbest. If the currentvalue is better than the previous pbest, then set the pbest value equal to thecurrent value and the phest location equal to the current location in the d-dimensional search space.5. Compare the best current fitness evaluation with the population gbest. If thecurrent value is better than the population gbest, then reset the gbest to thecurrent best position and the fitness value to current fitness value.6. Repeat steps 2-5 until a stopping criterion, such as sufficiently good gbestfitness or a maximum number of iterationsifunction evaluations is met.
Page 1 and 2: PERFORMANCE EVALUATION OFSWARM INTE
Page 3 and 4: DECLARATION1 hereby declare that th
Page 5 and 6: In practical systems, the operating
Page 7 and 8: ACKNOWLEDGEMENTI express my deep se
Page 9 and 10: CONTENTSCHAPTERTITLEPAGE No.ABSTRAC
Page 11 and 12: CHAPTER TITLE PAGE No.2.4.4.2. Eval
Page 13 and 14: PACE No.6.3.2. Phase Advance Compen
Page 15 and 16: TABLE No.2.15.2.16.2.17.2.18.2.19.2
Page 17 and 18: xviiTABLE No.TITLEPAGE No.A.6.B.1.B
Page 19 and 20: LIST OF FIGURESFIGURE No. TITLE PAG
Page 21 and 22: LIST OF ABBREVIATIONSPSOParticle Sw
Page 23 and 24: Initial weightFinal weightMaximum i
Page 25 and 26: I0v ISubscript jpdWm*=Balanced load
Page 29 and 30: programming, mixed integer pmgrammi
Page 31 and 32: 1.3.1. ECONOMIC LOAD DISPATCH PROBL
Page 33 and 34: Fung et al. [51] have formulated an
Page 35 and 36: een handled by BPSO, whereas the ec
Page 37 and 38: 13.4. DISTRIBUTED GENERATION @G) FO
Page 39 and 40: A new topology based on 2-source in
Page 41 and 42: A novel PSO-based approach to quant
Page 43 and 44: economic load dispatch (ELD) for co
Page 45 and 46: B. Constraint Satisfaction Techniqu
Page 47: itself and the term c,Rand,( ) x (g
Page 51 and 52: wlthln the constraints. The details
Page 53 and 54: 7. Modify the member position of ea
Page 55 and 56: By the method of curve fitting, the
Page 57 and 58: Table 2.2. Optimal scbeduliig of ge
Page 59 and 60: 5-5 1 0 1 5 m U m 3 5 . 0 U 5 0Nmnb
Page 61 and 62: Table 2.9. Solution odiffereut meth
Page 63 and 64: where V, (i) and VmX(1) are minimum
Page 65 and 66: 2. Initialize randomly the individu
Page 67 and 68: Table 2.1 1. ELD results obtained h
Page 69 and 70: The computational procedure of pric
Page 71 and 72: Table 2.14. CEED raub - IEEE-30 bus
Page 73 and 74: adjusted instantaneously. Even thou
Page 75 and 76: 2.43. Futures of Genetic Algorithms
Page 77 and 78: Tbe GA's can be distinguished hrn o
Page 79 and 80: 2. To each chromosome of the popula
Page 81 and 82: Table 2.16. Optimal generator dispa
Page 83 and 84: MethodGA method[421PSO method1421Hy
Page 85 and 86: Fig. 2.1 1 (;A-IDSO contergence cha
Page 87 and 88: CHAPTER 3INTEGRATED GA-PSO BASED UN
Page 89 and 90: upon any one of the two possible st
Page 91 and 92: where Tdom, is the minimum down tim
Page 93 and 94: 2. ... lln are integers ranging h m
Page 95 and 96: 3. For each chromosome economic loa
Page 97: Tnhle 3.2. C'ocl coefficients - IO-
Page 103 and 104:
3.5. CONCLUSIONIn this approach a h
Page 105 and 106:
to the corrective control of voltag
Page 107 and 108:
) OLTC tap position (discrete varia
Page 109 and 110:
4.5. SIMULATION RESULTSThe proposed
Page 111 and 112:
The continuous AVR operating values
Page 113 and 114:
Table 4.5. Optimal control variable
Page 115 and 116:
As discussed earlier, if the index
Page 117 and 118:
CHAPTER 5SWARM INTELLIGENCE BASED O
Page 119 and 120:
5.2. APPROACH TO QUANTIFY THE BENEF
Page 121 and 122:
5.2.2. Line loss redoction indexAno
Page 123 and 124:
53.1. Objective FunctionThc propose
Page 125 and 126:
various capacities. The voltage pro
Page 127 and 128:
~ .-0.2072 0.7309 26.910.2039 0.719
Page 129 and 130:
ITable 5.8. Solution of improvement
Page 131 and 132:
capacitive operation and minimum po
Page 133 and 134:
~xtensively used in present DVR con
Page 135 and 136:
6.3.2.1. DVR Power FlowThe power fl
Page 137 and 138:
(X'+Y:l0' =[i.. 1; ! ., I;]"IV,,COS
Page 139 and 140:
Subject toL,oad voltage advance ang
Page 141 and 142:
DVR is 99.906 KW for a balanced sag
Page 143 and 144:
GenerationsFig. 6.3.
Page 145 and 146:
CHAPTER 7CONCLUSIONThe thesis has i
Page 147 and 148:
(vi)(vii)obtained using PSO based m
Page 149:
APPENDICESAPPENDIX - ADATA FOR IEEE
Page 153 and 154:
Table A.3. Generator cost and Emins
Page 155 and 156:
APPENDIX - BDATA FOR 6 UNIT TEST SY
Page 157 and 158:
APPENDIX - CDATA FOR lIUNlT TEST SY
Page 159:
APPENDIX - DDATA FOR TAIPOWER 40-UN
Page 162 and 163:
A transmission llne on a per phase
Page 164 and 165:
y IS propagation constant and 1 is
Page 166 and 167:
APPENDIX - FSTANDARD - 5 BUS SYSTEM
Page 168 and 169:
APPENDM - GDATA FOR IEEE-14 BUS TES
Page 170 and 171:
Tabk G.2. Bus data and load flow re
Page 172:
APPENDIX - HDATA FOR AN IEEE-57 BUS
Page 178 and 179:
Table H3. Transformer tap setting d
Page 180 and 181:
Tabk 1.1. Sitar and location of dif
Page 182 and 183:
Tabk 1.3. Bus data
Page 184:
Table J.2. Bus data- - ---- -- -L.o
Page 187 and 188:
L. S. Vargas. V. H. Quintana, and V
Page 189 and 190:
J. F. Dapao and H. M. Merill. "Opti
Page 191 and 192:
P. H. Chen and H. C. Chang, "Large
Page 193 and 194:
M. Tripathy and S. Mishra, "Bacteri
Page 195 and 196:
[87] D. B. Fogel. "Evolut~onary Com
Page 197 and 198:
[I071 Costas Voumas and M~chael Kar
Page 199 and 200:
[I251 W. G. Scott, "M~cm-turb~ne ge
Page 201 and 202:
[I431 F. Jurado and Perez Hidalgo.
Page 203 and 204:
LIST OF PUBLICATIONSlnternational J
Page 205:
VITAEP.Ajay-D-Vimal Raj born in Kar
show all

performance evaluation of swarm intelligence based power system ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?