Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

New genetic algorithms for constrained optimisation and applications to design of composite laminates

Yu, Tat Loong 2004. New genetic algorithms for constrained optimisation and applications to design of composite laminates. PhD Thesis, Cardiff University.

[img] PDF - Accepted Post-Print Version
Download (13MB)

Abstract

A general purpose constraint handling technique for genetic algorithms (GA) is developed by borrowing principles from multi-objective optimisation. This is in view of the many issues still facing constraint handling in GA, particularly in the number of control parameters that overwhelms the user, as well as other GA parameters, which are currently lacking in heuristics to guide successful implementations. Constraints may be handled as individual objectives of decreasing priorities or by a weighted-sum measurement of normalised violation, as would be done in multi-objective scenarios, with full consideration of the main cost function. Rather than the unnecessary specialisation seen in many new heuristics proposed for GA, the simplicity, generality and flexibility of the technique is maintained, where several options such as partial or full constraint evaluation, tangible or Pareto-ranked fitness, and implicit dominance evaluation are presented. By reducing the number of constraint evaluations, these options increase the probability of discovering optimal regions, and hence increase GA efficiency. Studies in applications to a constrained numerical problem, and to the design of realistic composite laminate plates and structures, serve to demonstrate the ease of implementation and general reliability in heavily constrained problems. The difference in the dynamics of partial or full violation knowledge showed that while the former reduced the overall number of constraint evaluations performed, the latter compromises for the expense of full constraint evaluations in the reduced number of GA generations, whether in terms of discovering feasible regions or optimal solutions. The benefit of partial or full constraint evaluations is subjective, as it ultimately depends on the trade-off in the computational cost of constraint evaluations and GA search.

Item Type: Thesis (PhD)
Status: Unpublished
Schools: Engineering
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
ISBN: 9781303201332
Date of First Compliant Deposit: 30 March 2016
Last Modified: 10 Oct 2017 15:29
URI: http://orca-mwe.cf.ac.uk/id/eprint/55981

Citation Data

Cited 1 time in Google Scholar. View in Google Scholar

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics