Global Optimization for Mixed-Discrete Structural Design

Several structural design problems that involve continuous and discrete variables are very challenging because of the combinatorial and non-convex characteristics of the problems. Although the deterministic optimization approach theoretically guarantees to find the global optimum, it usually leads to a significant burden in computational time. This article studies the deterministic approach for globally solving mixed–discrete structural optimization problems. An improved method that symmetrically reduces the number of constraints for linearly expressing signomial terms with pure discrete variables is applied to significantly enhance the computational efficiency of obtaining the exact global optimum of the mixed–discrete structural design problem. Numerical experiments of solving the stepped cantilever beam design problem and the pressure vessel design problem are conducted to show the efficiency and effectiveness of the presented approach. Compared with existing methods, this study introduces fewer convex terms and constraints for transforming the mixed–discrete structural problem and uses much less computational time for solving the reformulated problem to global optimality.

[1]  Stephen P. Boyd,et al.  Optimal design of a CMOS op-amp via geometric programming , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Han-Lin Li,et al.  Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables , 2009, Oper. Res..

[3]  Jung-Fa Tsai,et al.  Global optimization of signomial mixed-integer nonlinear programming problems with free variables , 2008, J. Glob. Optim..

[4]  J. Ecker.  Geometric Programming: Methods, Computations and Applications , 1980 .

[5]  C. Floudas,et al.  Global Optimization in Generalized Geometric Programming , 1997, Encyclopedia of Optimization.

[6]  Joakim Westerlund,et al.  Some transformation techniques with applications in global optimization , 2009, J. Glob. Optim..

[7]  C. Floudas.  Global optimization in design and control of chemical process systems , 1998 .

[8]  Jung-Fa Tsai,et al.  A superior linearization method for signomial discrete functions in solving three-dimensional open-dimension rectangular packing problems , 2017 .

[9]  D. J. Wilde,et al.  A geometric programming algorithm for solving chemical equilibrium problems. , 1968 .

[10]  Hao-Chun Lu,et al.  A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions , 2013, Discret. Optim..

[11]  O. Hasançebi,et al.  Optimal design of planar and space structures with genetic algorithms , 2000 .

[12]  Peiping Shen,et al.  Global optimization of signomial geometric programming using linear relaxation , 2004, Appl. Math. Comput..

[13]  Hao-Chun Lu,et al.  Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms , 2017, J. Glob. Optim..

[14]  Ting-Yu Chen,et al.  Mixed–discrete structural optimization using a rank-niche evolution strategy , 2009 .

[15]  Jung-Fa Tsai,et al.  A deterministic global approach for mixed-discrete structural optimization , 2014 .

[16]  Jung-Fa Tsai,et al.  An improved framework for solving NLIPs with signomial terms in the objective or constraints to global optimality , 2013, Comput. Chem. Eng..

[17]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[18]  U. Passy,et al.  The Geometric Programming Dual to the Extinction Probability Problem in Simple Branching Processes , 1981 .

[19]  Christodoulos A. Floudas,et al.  Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions , 1999 .

[20]  Georg Thierauf,et al.  Evolution strategies for solving discrete optimization problems , 1996 .

[21]  Shu-Cherng Fang,et al.  A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems , 2013, INFORMS J. Comput..

[22]  Jung-Fa Tsai,et al.  Finding all global optima of engineering design problems with discrete signomial terms , 2020, Engineering Optimization.

[23]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2011, Math. Program..

[24]  Martin A. York,et al.  Application of Signomial Programming to Aircraft Design , 2017 .