Enhancing Branch-and-Bound Method for Structural Optimization
Publication: Journal of Structural Engineering
Volume 121, Issue 5
Abstract
The branch-and-bound method was originally developed to cope with difficulties caused by discontinuous design variables in linear programming. When the branch-and-bound method is applied to solve nonlinear programming (NLP) problems with a large number of mixed discontinuous and continuous design variables, the slow rate of convergence becomes a major drawback of the method. In this study, a number of enhancements are proposed to speed up the rate of convergence of the conventional branch-and-bound algorithm. Three NLP in the form of truss-design examples are tested to compare the capabilities and efficiency of the proposed enhancements. It is shown that of the five criteria for arranging the order in which the design variables are branched, the criterion of maximum cost difference dramatically reduces the number of branch nodes, thereby reducing the total number of continuous-optimization runs executed. Moreover, neighboring search, a branching procedure restricted in the neighborhood of the continuous optimum, is proven to be effective in speeding up the convergence. Investigation also shows that branching several design variables simultaneously is not as efficient as sequentially branching one variable at a time. The proposed enhancements are incorporated along with a sequential quadratic programming algorithm into a software package that is shown to be very useful in the optimal design of engineering structures.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Arora, J. S. (1989). Introduction to optimal design . McGraw-Hill, New York, N.Y.
2.
Arora, J. S., and Tseng, C. H. (1987). “IDESIGN: User's manual version 3.5.”Tech. Rep. No. OD-87.1, Optimal Des. Lab., Coll. of Engrg., Univ. of Iowa, Iowa City, Iowa.
3.
Arora, J. S., and Tseng, C. H. (1988). “Interactive design optimization.”Engrg. Optimization, Vol. 13, 173–188.
4.
Gochet, W., and Smeers, Y.(1979). “A branch-and-bound method for reverse geometric programming.”Operations Res., 27(5), 982–996.
5.
Gupta, O. K., and Ravindran, A. (1981). “Nonlinear integer programming and discrete optimization.”Progress in engineering optimization, R. W. Mayne and K. M. Ragsdell, eds., ASME, New York, N.Y. 27–32.
6.
Hager, K., and Balling, R.(1988). “New approach for discrete structural optimization.”J. Struct. Engrg., ASCE, 114(5), 1120–1134.
7.
Haug, E. J., and Arora, J. S. (1979). Applied optimal design: mechanical and structural systems . John Wiley & Sons, New York, N.Y.
8.
Lee, H. (1983). “An application of integer and discrete optimization in engineering design,” MS thesis, Univ. of Missouri-Columbia, Columbia, Mo.
9.
Sandgren, E. (1990). “Nonlinear integer and discrete programming in mechanical design.”J. Mech. Des., Vol. 112, 223–229.
10.
Siddall, J. N. (1982). Optimal engineering design: principles and applications . Marcel Dekker, New York, N.Y.
11.
Thanedar, P. B., Arora, J. S., Tseng, C. H., Lim, O. K., and Park, G. J. (1986). “Performance of some SQP algorithms on structural design problems.”Int. J. Numerical Methods in Engrg., Vol. 23, 2187–2203.
12.
Tseng, C. H., and Kao, K. Y.(1989). “Performance of a hybrid sensitivity analysis on structural design problems.”Computers and Struct., 33(5), 1125–1131.
13.
Tseng, C. H., and Wang, L. W. (1989). “The application of branch-and-bound method in large number of non-continuous design variables optimization.”Tech. Rep., Nat. Chiao Tung Univ., Taiwan, Republic of China.
14.
Vanderplaats, G. N., and Thanedar, P. B. (1991). “A survey of discrete variable optimization for structural design.”Proc., 10th Conf. on Electronic Computation in Struct. Engrg., ASCE, New York, N.Y.
Information & Authors
Information
Published In
Copyright
Copyright © 1995 American Society of Civil Engineers.
History
Published online: May 1, 1995
Published in print: May 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.