Abstract
Many optimum structural designs are based on searching for the best of all combinations, arising from the number of structural members, and parameters of listed rolled profiles. Even, in a relatively simple design, the number of such combinations is of an order higher than ten. All known methods of finding discrete minimum of structural weight require very large number of analyses often of an order of four. In this study, a relatively simple method of solving such problems is presented. It is based on a tree graph, representing discrete values of the structural volume. The structure can be subjected to multi static loadings with constraints imposed on displacements and stresses. The number of analyses, in the proposed algorithm, is limited to the order of two. The knowledge needed to apply the method is limited to FEM and graph representation. The paper is illustrated with two examples with numbers of combinations up to 4238.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arora JS (2002) Methods for discrete variable structural optimization. In: Burns SA (ed) Recent advances in optimal structural design. ASCE, Reston, pp 1–40
Distefano N, Rath A (1975) A dynamic programming approach to the optimization of elastic trusses. J Optim Theory Appl 15(1):13–26
Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Soc Math 64:275–278
Groenwold AA, Stander N (1997) Optimal discrete sizing of truss structures subject to buckling constraints. Struct Optim 14:71–80
Guerlement G, Gutkowski W, Targowski R, Zawidzka J, Zawidzki J (2001) Discrete minimum weight design of steel structures using EC3 code. Struct Multidisc Optim 22:322–327
Gutkowski W (1997) Structural optimization with discrete design variables. Eur J Mech A, Solids 16:107–126 (Special issue)
Gutkowski W, Bauer J, Iwanow Z (1993) Support number and allocation for optimum structure. In: Gutkowski W, Bauer J (eds) Discrete structural optimization. Proc IUTAM symposium, pp 168–177
Gutkowski W, Iwanow Z, Bauer J (2001) Controlled mutation in evolutionary structural optimization. Struct Multidisc Optim 21(6):355–360
Iwanow Z (1990) An algorithm for finding an ordered sequence of values of a discrete linear function. Control Cybern 6:238–249
Juang DS, Chang WT (2006) A revised discrete Lagrangian-based search algorithm for the optimal design of skeletal structures using available sections. Struct Multidisc Optim 31(3):211–223
Kitayama S, Arakawa M, Yamazaki K (2006) Penality function approach for the mixed discrete nonlinear problems by particle swarm optimization. Struct Multidisc Optim 32(3):191–202
Lee KS, Geem ZW, Lee S, Bae KW (2005) The harmony search heuristic algorithm for discrete structural optimization. Eng Optim 37(8):663–684
Srivastava VK, Fahim A (2007) An optimization method for solving mixed discrete–continuous programming problems. Comput Math Appl 53(10):1481–1491
Templeman AB (1988) Discrete optimum structural design. Comput Struct 30:511–518
Toaklay AR (1968) Optimum design using available sections. Proc ASCE J Struct Div 94:1219–1241
Vanderplaats GN, Thanedar PB (1991) A survey of discrete variable opitimization for structural design. In: Ural O, Wang TL (eds) Proc of tenth ASCE conference on electronic computation, Indiana. ASCE, pp 173–180
Yates DF, Templeman AB, Boffey TB (1982) The complexity of procedures for determining minimum weight trusses with discrete member size. Int J Solids Struct 18(7):487–495
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Blachowski, B., Gutkowski, W. A hybrid continuous-discrete approach to large discrete structural optimization problems. Struct Multidisc Optim 41, 965–977 (2010). https://doi.org/10.1007/s00158-009-0466-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-009-0466-1