This paper describes a genetic algorithm (GA) developed for the reconfiguration of radial distribution systems. The reconfiguration is treated as an optimization problem of combinatory nature, where the aim is to obtain a configuration with minimal power losses, iterations and also with some distribution system restrictions. The initial population of the GA is obtained using spanning trees techniques (ST). Further, efficient operators for crossing and mutation are used to explore the search space. Each individual aptitude is evaluated by means of a power flows program. The developed algorithm is applied to a distribution system reconfiguration, obtaining satisfactory results.
Reconfiguration of Power Distribution Systems Using Genetic Algorithms and Spanning Trees
2010-09-01
236566 byte
Conference paper
Electronic Resource
English
Genetic algorithms for reconfiguration.
Online Contents | 1996
|Genetic algorithms for reconfiguration
Tema Archive | 1996
|Distribution Systems Reconfiguration Using Ant Colony Optimization and Harmony Search Algorithms
Online Contents | 2013
|2D image segmentation using minimum spanning trees
British Library Online Contents | 1997
|Network Reconfiguration for Load Balancing in Radial Distribution Systems Using Genetic Algorithm
Online Contents | 2008
|