Layout optimization of large‐scale pin‐jointed frames

Computerized layout (or “topology”) optimization was pioneered almost four decades back. However, despite dramatic increases in available computer power and the application of increasingly efficient optimization algorithms, even now only relatively modest sized problems can be tackled using the traditional “ground structure” approach. This is because of the need, in general, for the latter to contain every conceivable member connecting together the nodes in a problem. A simple, but effective solution method capable of tackling problems with large numbers of potential members (e.g. >100,000,000) is presented. Though the method draws on the linear programming technique of “column generation”, since layout optimization specific heuristics are employed it is presented as an iterative “member adding” method. The method requires a ground structure with minimal connectivity to be used in the first iteration; members are then added as required in subsequent iterations until the (provably) optimal solution is found.