Variable chromosome length genetic algorithm for progressive refinement in topology optimization

Variable chromosome length genetic algorithm for progressive refinement in topology optimization

0.00 Avg rating0 Votes
Article ID: iaor20052613
Country: Germany
Volume: 29
Issue: 6
Start Page Number: 445
End Page Number: 456
Publication Date: Jun 2005
Journal: Structural and Multidisciplinary Optimization
Authors: ,
Keywords: engineering, heuristics, optimization
Abstract:

This article introduces variable chromosome lengths (VCL) in the context of a genetic algorithm (GA). This concept is applied to structural topology optimization but is also suitable to a broader class of design problems. In traditional genetic algorithms, the chromosome length is determined a priori when the phenotype is encoded into the corresponding genotype. Subsequently, the chromosome length does not change. This approach does not effectively solve problems with large numbers of design variables in complex design spaces such as those encountered in structural topology optimization. We propose an alternative approach based on a progressive refinement strategy, where a GA starts with a short chromosome and first finds an ‘optimum’ solution in the simple design space. The ‘optimum’ solutions are then transferred to the following stages with longer chromosomes, while maintaining diversity in the population. Progressively refined solutions are obtained in subsequent stages. A strain energy filter is used in order to filter out inefficiently used design cells such as protrusions or isolated islands. The variable chromosome length genetic algorithm (VCL-GA) is applied to two structural topology optimization problems: a short cantilever and a bridge problem. The performance of the method is compared to a brute-force approach GA, which operates ab initio at the highest level of resolution.

Reviews

Required fields are marked *. Your email address will not be published.