Form-finding of nonregular tensegrities using a genetic algorithm

In this paper, the form-finding problem of nonregular tensegrities was converted into a constrained optimization problem. A genetic algorithm was used to solve this problem. Two cases of form-finding were considered. In the first case, the number of members, the rest lengths of members, the elastic moduli of members and the connectivity of members were given, and the only variables are the initial locations of nodes. In the second case, the elastic moduli of members were also treated as variables besides the initial locations of nodes. Typical examples were carried out to verify the proposed method.