Genetic Algorithms (GAs) are powerful tools to solve large scale design optimization problems. The research interests in GAs lie in both its theory and application. On one hand, various modifications have been made on early GAs to allow them to solve problems faster, more accurately and more reliably. On the other hand, GA is used to solve complicated design optimization problems in different applications. The study in this thesis is both theoretical and applied in nature. On the theoretical side, an improved GAÃ¢â‚¬â€�Evolution Direction Guided GA (EDG-GA) is proposed based on the analysis of Schema Theory and Building Block Hypothesis. In addition, a method is developed to study the structure of GA solution space by characterizing interactions between genes. This method is further used to determine crossover points for selective crossover. On the application side, GA is applied to generate optimal tolerance assignment plans for a series of manufacturing processes. It is shown that the optimal tolerance assignment plan achieved by GA is better than that achieved by other optimization methods such as sensitivity analysis, given comparable computation time.
Worcester Polytechnic Institute
All authors have granted to WPI a nonexclusive royalty-free license to distribute copies of the work. Copyright is held by the author or authors, with all rights reserved, unless otherwise noted. If you have any questions, please contact firstname.lastname@example.org.
Zhou, Yao, "Study on Genetic Algorithm Improvement and Application" (2006). Masters Theses (All Theses, All Years). 667.
tolerance assignment, genetic algorithms, Genetic algorithms, Multidisciplinary design optimization