An improved LHS approach for constrained design space based on successive local enumeration algorithm

Surrogate models are commonly used to replace expensive simulations in engineering design and optimization by virtue of their low computational cost and high prediction accuracy. The design of experiments (DoE) plays an indispensable role in constructing surrogate models. However, most of existing DoEs are applied to regular design space such as rectangular or cube space, and not applied to constrained design space. An approach of Latin Hypercube Sampling (LHS) based on successive local enumeration (SLE) named SLE-LHS is such a kind of algorithm. In this paper, an improved SLE-LHS approach for constrained design space is proposed, named as SLE-CLHS approach. Compared with the existing LHS methods based on maximin algorithm, SLE-LHS algorithm employs global objective functions and a sequential local objective function aiming at maximizing the minimum distance between the sample points and the untried points. The proposed SLE-CLHS is an improved algorithm of SLE-LHS, which taking into account constraints between the sample variables and can be used in the constrained space. In the process of design, the points that do not satisfy the constrained condition are to be eliminated, then new points are generated in the constrained space and they will be updated until the optimal position has been attained. Two numerical examples are given in this paper, and the results of 2-D and 3-D sampling in constrained design space indicate that the SLE-CLHS approach performs well both in space-filling and in projection.

[1]  Ronald L. Iman,et al.  Risk methodology for geologic disposal of radioactive waste: small sample sensitivity analysis techniques for computer models, with an application to risk assessment , 1980 .

[2]  Bertrand Iooss,et al.  Latin hypercube sampling with inequality constraints , 2009, 0909.0329.

[3]  S. Bates,et al.  Formulation of the Audze--Eglais uniform Latin hypercube design of experiments , 2003 .

[4]  Christian Dehlendorff,et al.  Design of Computer Experiments , 2010 .

[5]  G. Venter,et al.  An algorithm for fast optimal Latin hypercube design of experiments , 2010 .

[6]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[7]  T. J. Mitchell,et al.  Exploratory designs for computational experiments , 1995 .

[8]  Jon Lee.  Maximum entropy sampling , 2001 .

[9]  M. E. Johnson,et al.  Minimax and maximin distance designs , 1990 .

[10]  Dick den Hertog,et al.  Constrained Maximin Designs for Computer Experiments , 2003, Technometrics.

[11]  Johann Sienz,et al.  Formulation of the Optimal Latin Hypercube Design of Experiments Using a Permutation Genetic Algorithm , 2004 .

[12]  M. D. McKay,et al.  A comparison of three methods for selecting values of input variables in the analysis of output from a computer code , 2000 .

[13]  Li Liu,et al.  A novel algorithm of maximin Latin hypercube design using successive local enumeration , 2012 .