Improved evolutionary programming with dynamic mutation and metropolis criteria for multi-objective reactive power optimisation

被引:18
作者
Jiang, C [1 ]
Wang, C [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200030, Peoples R China
关键词
D O I
10.1049/ip-gtd:20045007
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Reactive power optimisation is an important technique, which is concerned with the security and economy of operation of the power system. The appropriate distribution of reactive power can elevate voltage rating, decrease network losses and maintain network running under proper conditions. An improved evolutionary programming method with dynamic mutation and metropolis selection to solve the multi-objective reactive power optimisation under the deregulation environment is presented. The multi-objective function includes the minimisation of network losses, voltage deviation and compensation cost. To solve the problems of convergence and robustness in the conventional evolutionary programming method, the mutation operators and the selection criteria that affect the convergence and robustness are considered and a dynamic mutation and metropolis selection evolutionary programming method is suggested. Introducing chaos dynamics into mutation operators of evolutionary programming, the new method adopts the certainty method of like-stochastic to obtain mutation operators which break through the conventional thought with mutation by stochastic numbers of fixed distribution. Also, it introduces the metropolis selection in evolutionary programming to construct new selection operators. Thus, the new method not only accelerates convergence but also increases precision, so is an efficient way to optimise the capacitor banks and the adjustable transformer ratio. Tested by the IEEE-30 bus system, the method is effective.
引用
收藏
页码:291 / 294
页数:4
相关论文
共 15 条
[1]  
BOMING Z, 1996, HIGH ELECT POWER NET, P311
[2]   Chaotic sequences to improve the performance of evolutionary algorithms [J].
Caponetto, R ;
Fortuna, L ;
Fazzino, S ;
Xibilia, MG .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) :289-304
[3]  
CARLOS A, 1999, KNOWL INF SYST, V1, P269
[4]  
Chellapilla K, P SPIE INT S OPT SCI, P260
[5]   Reactive power dispatch with a hybrid stochastic search technique [J].
Das, DB ;
Patvardhan, C .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2002, 24 (09) :731-736
[6]   A Cauchy-based evolution strategy for solving the reactive power dispatch problem [J].
Gomes, JR ;
Saavedra, OR .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2002, 24 (04) :277-283
[7]   Optimal reactive power dispatch using evolutionary computation: Extended algorithms [J].
Gomes, JR ;
Saavedra, OR .
IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 1999, 146 (06) :586-592
[8]  
JIANG CW, 2000, J HYDRODYNAMICS, V12, P85
[9]   Application of evolutionary programming to reactive power planning - Comparison with nonlinear programming approach [J].
Lai, LL ;
Ma, JT .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1997, 12 (01) :198-204
[10]   Evolutionary programming approach to reactive power planning [J].
Ma, JT ;
Lai, LL .
IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 1996, 143 (04) :365-370