Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 7/8
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON THE DESIGN AND CONSTRUCTION OF NON-CONVENTIONAL STRUCTURES Edited by: B.H.V. Topping
Paper XVI.6
Shape Optimization of Space Trusses M.P. Saka* and B. Attili+
*Civil Engineering Department
M.P. Saka, B. Attili, "Shape Optimization of Space Trusses", in B.H.V. Topping, (Editor), "Proceedings of the International Conference on the Design and Construction of Non-Conventional Structures", Civil-Comp Press, Edinburgh, UK, pp 115-121, 1987. doi:10.4203/ccp.7.16.6
Abstract
Structural shape optimization is of a major interest to designers. The early attempt for solving such problems by analytical methods goes back as far as 1904 (Michell). However, it is the development of the numerical methods of optimization which made it possible to produce practically feasible algorithms.
In this study, an algorithm is presented for the shape optimization of space trusses. The method considers the displacement stress, buckling and minimum size constraints. AISC code were used to include the buckling constraints in the design formulation. The cross sectional areas of different members and joint coordinates of joints were taken as design variables. The algorithm is also flexible enough to treat only those of specified joint coordinates as variables while keeping the rest unchanged. The displacement constraints were included in the design problem by the optimality criteria approach. The shape optimization problem formulated comes out to be highly nonlinear. Approximating programming is employed for its solution. This method linearizes the nonlinear objective function and constraints and then employs the simplex method to solve the resulting linear programming problem. Sequential application of this procedure converges to the optimum. Number of design examples are considered to demonstrate the application of the algorithm. purchase the full-text of this paper (price £20)
go to the previous paper |
|