Optimization Frameworks for Discrete Composite Laminate Stacking Sequences
| dc.contributor.author | Adams, David Bruce | en |
| dc.contributor.committeechair | Watson, Layne T. | en |
| dc.contributor.committeemember | Ribbens, Calvin J. | en |
| dc.contributor.committeemember | Anderson-Cook, Christine M. | en |
| dc.contributor.committeemember | Heath, Lenwood S. | en |
| dc.contributor.committeemember | Gürdal, Zafer | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2014-03-14T20:15:06Z | en |
| dc.date.adate | 2005-08-23 | en |
| dc.date.available | 2014-03-14T20:15:06Z | en |
| dc.date.issued | 2005-07-20 | en |
| dc.date.rdate | 2005-08-23 | en |
| dc.date.sdate | 2005-08-12 | en |
| dc.description.abstract | Composite panel structure optimization is commonly decomposed into panel optimization subproblems, with specified local loads, resulting in manufacturing incompatibilities between adjacent panel designs. Using genetic algorithms to optimize local panel stacking sequences allows panel populations of stacking sequences to evolve in parallel and send migrants to adjacent panels, so as to blend the local panel designs globally. The blending process is accomplished using the edit distance between individuals of a population and the set of migrants from adjacent panels. The objective function evaluating the fitness of designs is modified according to the severity of mismatches detected between neighboring populations. This lays the ground work for natural evolution to a blended global solution without leaving the paradigm of genetic algorithms. An additional method applied here for constructing globally blended panel designs uses a parallel decomposition antithetical to that of earlier work. Rather than performing concurrent panel genetic optimizations, a single genetic optimization is conducted for the entire structure with the parallelism solely within the fitness evaluations. A guide based genetic algorithm approach is introduced to exclusively generate and evaluate valid globally blended designs, utilizing a simple master-slave parallel implementation, implicitly reducing the size of the problem design space and increasing the quality of discovered local optima. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-08122005-135419 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-08122005-135419/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/28631 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | backup.tar.gz | en |
| dc.relation.haspart | thesis.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Blending | en |
| dc.subject | Decomposition | en |
| dc.subject | Genetic Algorithms | en |
| dc.subject | Composite Laminates | en |
| dc.subject | Combinatorial Optimization | en |
| dc.subject | Parallel Computing | en |
| dc.title | Optimization Frameworks for Discrete Composite Laminate Stacking Sequences | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |