City Research Online

Abstract

Genetic Algorithms (GAs) are search algorithms based on the principle of natural selection and survival of the fittest to stochastically improve generated initial population of solutions. Only the most promising regions of the search space are enumerated to locate the optimal solution.

The problems covered in this thesis investigates the application of GAs for the determination of worst combinations of loadings and stay removals for large size cable-stayed bridges subject to combinatorial loads such as traffic loads and loads arising from cables out conditions.

Stay removal conditions came out as a result of the obligations imposed by the Department of Transport in Britain that their cable-stayed crossing must be functional under traffic loads with upto two cables missing. This has made the design/analysis of cable-stayed bridges, which is an iterative process, to be extremely complicated and very expensive.

In contrast to many classic optimisation problems which involve solely one load condition without consideration of member failures removals, the main purpose of the thesis is to investigate the potential for the application of GAs to such design situation in which the combinatorial problem of load definitions and stay removals play a particularly important role. For this reason problems associated with highway loading defined in BD37/88 and stay removal conditions will be given special attention in the context of using GAs for the locating of the worst loading/stay removal combinations.

Publication Type:	Thesis (Doctoral)
Subjects:	T Technology > TA Engineering (General). Civil engineering (General)
Departments:	School of Science & Technology School of Science & Technology > Engineering School of Science & Technology > School of Science & Technology Doctoral Theses

Export

Downloads