A genetic algorithm approach to single and multiobjective structural optimization with discrete–continuous variables

Abstract

Abstract A search procedure with a philosophical basis in molecular biology is adapted for solving single and multiobjective structural optimization problems. This procedure, known as a genetic algorithm (GA). utilizes a blending of the principles of natural genetics and natural selection. A lack of dependence on the gradient information makes GAs less susceptible to pitfalls of convergence to a local optimum. To model the multiple objective functions in the problem formulation, a co‐operative game theoretic approach is proposed. Examples dealing with single and multiobjective geometrical design of structures with discrete–continuous design variables, and using artificial genetic search are presented. Simulation results indicate that GAs converge to optimum solutions by searching only a small fraction of the solution space. The optimum solutions obtained using GAs compare favourably with optimum solutions obtained using gradient‐based search techniques. The results indicate that the efficiency and power of GAs can be effectively utilized to solve a broad spectrum of design optimization problems with discrete and continuous variables with similar efficiency.