Survey of Discrete Variable Optimization for Structural Design
Publication: Journal of Structural Engineering
Volume 121, Issue 2
Abstract
Available methods for discrete variable structural optimization are reviewed in this paper. Methods are classified according to three categories: branch and bound, approximations using branch and bound, and ad-hoc methods. The branch and bound method is theoretically correct for convex design tasks but is costly to use. Approximation methods provide efficiency but do not guarantee an optimum discrete solution. In a majority of the discrete optimization problems, approximation methods provide useful solutions and have been found to be the most practical. Ad-hoc methods such as simulated annealing and genetic algorithms attempt to solve the discrete variable problem without resorting to branch and bound methods, and do not guarantee an optimum solution. However, ad-hoc methods provide reasonable solution at an acceptable computational cost. A stepped cantilever beam example is solved using branch and bound and approximation methods, to give a computational sense of the efforts involved in solving discrete variable optimization problems.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Balling, R. J., and May, S. A. (1990). “Large scale discrete structural optimization: simulated annealing, branch and bound and other techniques.”Proc., 3rd Air Force/NASA Symp. on Recent Adv. in Multidisciplinary Anal. and Optimization, San Francisco, Calif.
2.
Bendose, M., and Mota Soares, C. A. (1993). “Topology design of structures.”Proc., NATO ASI, Kluwer Publications.
3.
Bremicker, M., Papalambros, P. Y., and Loh, H. T.(1990). “Solution of mixed-discrete structural optimization problems with a new sequential linearization method.”Computers and Struct., 37(4), 451–461.
4.
Cha, J. Z., and Mayne, R. W.(1989a). “Optimization with discrete variables via recursive quadratic programming. Part 1: Concepts and definitions.”Trans., ASME, 111(3), 124–129.
5.
Cha, J. Z., and Mayne, R. W.(1989b). “Optimization with discrete variables via recursive quadratic programming. Part 2: Algorithms and results.”Trans., ASME, 111(3), 130–136.
6.
Dakin, R. J.(1965). “A tree search algorithm for mixed integer programming problems.”Computer J., 8(1), 250–255.
7.
Fleury, C., and Braibant, V.(1986). “Structural optimization—a new dual method using mixed variables.”Int. J. for Numerical Methods in Engrg., 23(2), 409–428.
8.
Garfinkel, R., and Nemhauser, G. (1972). Integer programming . John Wiley and Sons, New York, N.Y.
9.
Glover, F., and Sommer, D.(1975). “Pitfalls of rounding in discrete management decision variables.”Decision Sci., 22(4), 455–460.
10.
Goldberg, D. E., and Kuo, C. H.(1987). “Genetic algorithms in pipeline optimization.”J. Computing in Civ. Engrg., ASCE, 1(2), 128–141.
11.
Grierson, D. E. (1987). “Computer-aided design of building frameworks under various performance conditions.”Computer aided optimal design: structural and mechanical systems, C. A. Mota Soares, ed., Springer Verlag, New York, N.Y., 355–380.
12.
Gupta, O. K., and Ravindran, A. (1984). “Nonlinear mixed integer programming and discrete optimization.”Progress in engineering optimization, R. W. Mayne, and K. M. Ragsdell, eds., New York, N.Y., 297–520.
13.
Land, A. H., and Doig, A.(1960). “An automatic method of solving discrete programming problems.”Econometrica, 28(4), 297–520.
14.
Mesquita, L., and Kamat, M. P.(1987). “Optimization of stiffened laminated composite plates with frequency constraints.”Engrg. Optimization, 11(5), 77–88.
15.
Olsen, G., and Vanderplaats, G. N.(1989). “A method for nonlinear optimization with discrete variables.”AIAA J., 27(11), 1584–1589.
16.
Pappas, M., and Altentuch, A. (1974). “Mathematical programming procedures for mixed discrete-continuous design problems.”J. Engrg. for Industry; Trans., ASME, 102(5), 201–209.
17.
Reiter, S., and Sherman, G.(1965). “Discrete programming.”J. Soc. for Industrial and Appl. Math., 13(6), 864–889.
18.
Sandgren, E.(1990a). “Nonlinear integer and discrete programming in mechanical design optimization.”ASME J. Mech. Des., 112(2), 223–229.
19.
Sandgren, E.(1990b). “Nonlinear integer and discrete programming for topological decision making in engineering design.”ASME Mech. J. Des., 112(1), 108–112.
20.
Shin, D. K., Gurdal, Z., and Griffin, O. H.(1990). “A penalty approach for nonlinear optimization with discrete design variables.”Engrg. Optimization, 6(1), 29–42.
21.
Schmit, L. A., and Fleury, C.(1980). “Discrete-continuous variable structural synthesis using dual methods.”AIAA J., 18(4), 1515–1524.
22.
Tseng, C. H., Wang, L. W., and Ling, S. F. (1992). “A numerical study of the branch and bound method in structural optimization.”Tech. Rep., Dept. of Mech. Engrg., National Chiao Tung Univ., Hsinchu, Taiwan, China.
23.
Vanderplaats, G. N. (1990). “General purpose optimization software for engineering design.”Proc., 3rd Air Force/NASA Symp. on Recent Adv. in Multi disciplinary Anal. and Optimization, San Francisco, Calif.
Information & Authors
Information
Published In
Journal of Structural Engineering
Volume 121 • Issue 2 • February 1995
Pages: 301 - 306
Copyright
Copyright © 1995 American Society of Civil Engineers.
History
Published online: Feb 1, 1995
Published in print: Feb 1995
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.