The planning of distribution systems consists in determining the optimum site and size of new substations and feeders in order to satisfy the future power demand with minimum investment and operational costs and an acceptable level of reliability. This problem is a combinatorial, non-linear and constrained optimization problem. Several solution methods based on genetic algorithms have been reported in the literature; however, some of these methods have been reported with applications to small systems while others have long solution time. In addition, the vast majority of the developed methods handle planning problems simplifying them as single-objective problems but, there are some planning aspects that can not be combined into a single scalar objective; therefore, they require to be treated separately. The cause of these shortcomings is the poor representation of the potential solutions and their genetic operators This thesis presents the design of a genetic algorithm using a direct representation technique and specialized genetic operators for power distribution system expansion planning problems. These operators effectively preserve and exploit critical configurations that contribute to the optimization of the objective function. The constraints of the problems are efficiently handle with new strategies. The genetic algorithm was tested on several theoretical and real large-scale power distribution systems. Problems of network reconfiguration for loss reduction were also included in order to show the potential of the algorithm to resolve operational problems. Both single-objective and multi-objective formulations were considered in the tests. The results were compared with results from other heuristic methods such as ant colony system algorithms, evolutionary programming, differential evolution and other genetic algorithms reported in the literature. From these comparisons it was concluded that the proposed genetic algorithm is suitable to resolve problems of largescale power distribution system planning. Moreover, the algorithm proved to be effective, efficient and robust with better performance than other previous methods.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:412319 |
| Date | January 2004 |
| Creators | Rivas-Davalos, Francisco |
| Contributors | Irving, M. R. |
| Publisher | Brunel University |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://bura.brunel.ac.uk/handle/2438/7891 |
Page generated in 0.0024 seconds