|
Georgia Tech's Institutional Repository >
Georgia Tech Theses and Dissertations >
Georgia Tech Theses and Dissertations >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1853/29758
|
| Title: | An evolutionary method for synthesizing technological planning and architectural advance |
| Authors: | Cole, Bjorn Forstrom Aerospace Engineering |
| Advisor: | Committee Chair: Mavris, Dimitri; Committee Member: Costello, Mark; Committee Member: German, Brian |
| Subjects : | Combinatorial optimization Systems engineering Strategic planning Architecture Genetic algorithms Algorithms Problem solving |
| Issue Date: | 18-May-2009 |
| Publisher: | Georgia Institute of Technology |
| Abstract: | There are many times in which a critical choice between proposed system architectures must be made. Two situations in particular motivate this dissertation: a "Cambrian explosion" when no dominant rchitecture has arisen, and times in which developments enable challenges to a dominant incumbent. In each situation, the advance of core technologies is key.
This dissertation features a new computing technique to systematically explore the interaction of technological progress with architectural choices. This technique is founded upon a graph theoretic formulation of architecture, which enables the consideration of multifunctional components and modularity v. synergy trades. The technique utilizes a genetic algorithm formulated for graphs, and a solver that automatically constrains and optimizes component design variables. The use of quantitative technology models, graph theoretic formulation, and optimization algorithms together enables a systematic exploration of both time and combinatorial spaces. The quantitative results of this exploration enhance the strategic view of technology planners. |
| Type: | Dissertation |
| URI: | http://hdl.handle.net/1853/29758 |
| Appears in Collections: | School of Aerospace Engineering Theses and Dissertations Georgia Tech Theses and Dissertations
|
Items in SMARTech are protected by copyright, with all rights reserved, unless otherwise indicated.
|