A survey of methods for discrete optimum struct ural design
Abstract
The available methods and solutions of problems in discrete optimum structural design are reviewed. They are classified into the following categories: branch and bound methods, dual approach, enumeration methods, penalty function approach, simulated annealing and other methods. For the majority of problems, none of the methods is guaranteed to give the exact solution from the mathematical point of view. However, "good practical" solutions can be obtained at an acceptable cost.
References
[1968, a] D.A. Maciulevicius. Synthesis of pin-jointed structures with the given assortment of material (in Russian). Lit. Mech. Sbornik, 2:5- 15.
[1968, b] A.R. Toakley. Optimum design using available sections. Proc. ASCE J. Struct. Div., 94:1219- 1241.
[1969, a] A.A. Korbut and J.J. Finkelsztejn. Discrete Programming, (in Russian). Nauka, Moskva.
[1971, a] K.F. Reinschmidt. Discrete structural optimization. Proc. ASCE, J. Struct. Div., 97:133-156.
[1971, b] H. Greenberg. Integer Programming. Academic Press, New York.
[1972, a] R.S. Garfinkel and G.L. Nemhauser. Integer Programming. Wiley, New York.
[1973, a] A. Cella and K. Soosaar. Discrete variables in structural optimization. In: R.M. Gallagher and O.C. Zienkiewicz, eds., Optimum Structural Design. Theory and Applications. Wiley, 201-222.