DocumentCode :
632002
Title :
Discrete evolutionary programming to solve network reconfiguration problem
Author :
Aman, M.M. ; Jasmon, G.B. ; Naidu, Kajal ; A. Bakar, A. ; Mokhlis, H.
Author_Institution :
Dept. of Electr. Eng., Univ. of Malaya, Kuala Lumpur, Malaysia
fYear :
2013
fDate :
17-19 April 2013
Firstpage :
505
Lastpage :
509
Abstract :
This paper proposes a new discrete approach to solve network reconfiguration of power system. Like other problems of optimization, network reconfiguration is different. Here the positions of tie switches represent integer numbers, thus the Gaussian formulation and rounding off the number, in this case is not very useful. Evolutionary Programming (EP) based discrete optimization technique is proposed to find out the optimum switch(s) combination. Minimization of power losses is considered as a fitness function. The proposed technique is tested on standard 33-bus and 69-bus radial distribution network, having 5-tie switches. The result shows that the proposed technique achieve better fitness function in less computation time and less number of iterations.
Keywords :
evolutionary computation; minimisation; power system simulation; 69-bus radial distribution network; Gaussian formulation; discrete evolutionary programming; fitness function; integer numbers; minimization; network reconfiguration problem; optimum switch combination; power losses; power system; standard 33-bus; tie switches; Convergence; Genetic algorithms; Optimization; Programming; Sociology; Statistics; Switches; Discrete Optimization; Evoluationary Programming; Losses Minimization; Network Reconfiguration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON Spring Conference, 2013 IEEE
Conference_Location :
Sydney, NSW
Print_ISBN :
978-1-4673-6347-1
Type :
conf
DOI :
10.1109/TENCONSpring.2013.6584496
Filename :
6584496
Link To Document :
بازگشت