Brunel University Research Archive (BURA) >
College of Engineering, Design and Physical Sciences >
Dept of Electronic and Computer Engineering >
Dept of Electronic and Computer Engineering Thesis >
Please use this identifier to cite or link to this item:
|Title: ||Power transmission planning using heuristic optimisation techniques: Deterministic crowding genetic algorithms and Ant colony search methods|
|Authors: ||Chebbo, Hind Munzer|
|Advisors: ||Irving, MR|
|Publication Date: ||2000|
|Publisher: ||Brunel University School of Engineering and Design PhD Theses|
|Abstract: ||The goal of transmission planning in electric power systems is a robust network which is economical, reliable, and in harmony with its environment taking into account the inherent uncertainties. For reasons of practicality, transmission planners have normally taken an incremental approach and tended to evaluate a relatively small number of expansion alternatives over a relatively short time horizon.
In this thesis, two new planning methodologies namely the Deterministic Crowding Genetic Algorithm and the Ant Colony System are applied to solve the long term transmission planning problem. Both optimisation techniques consider a 'green field' approach, and are not constrained by the existing network design. They both identify the optimal transmission network over an extended time horizon based only on the expected pattern of electricity demand and generation sources.
Two computer codes have been developed. An initial comparative investigation of the application of Ant Colony Optimisation and a Genetic Algorithm to an artificial test problem has been undertaken. It was found that both approaches were comparable for the artificial test problem.|
|Description: ||This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.|
|Sponsorship: ||EPRSC and National Grid Company plc|
|Appears in Collections:||Electronic and Computer Engineering|
Dept of Electronic and Computer Engineering Thesis
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.