Structural topology design optimization using Genetic Algorithms with a bit-array representation

doi:10.1016/j.cma.2004.09.003

Return

Structural topology design optimization using Genetic Algorithms with a bit-array representation

2005-09-01

145

PRE

S.Y. Wang

Kang Tai

DOI：10.1016/j.cma.2004.09.003

Original

Original request for help

Save

Abstract

En 中文

In this paper, a bit-array representation method for structural topology optimization using the Genetic Algorithm (GA) is implemented. The importance of structural connectivity in a design is further emphasized by considering the total number of connected objects of each individual explicitly in an equality constraint function. To evaluate the constrained objective function, Deb's constraint handling approach is further developed to ensure that feasible individuals are always better than infeasible ones in the population to improve the efficiency of the GA. A violation penalty method is proposed to drive the GA search towards the topologies with higher structural performance, less unusable material and fewer separate objects in the design domain. An identical initialization method is also proposed to improve the GA performance in dealing with problems with long narrow design domains. Numerical results of structural topology optimization problems of minimum weight and minimum compliance designs show the success of this bit-array representation method and suggest that the GA performance can be significantly improved by handling the design connectivity properly. (c) 2004 Elsevier B.V. All rights reserved.

Keywords:

structural topology optimization

bit-array representation

design connectivity

representation degeneracy

Genetic Algorithms

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.