Bounds for Maximin Latin Hypercube Designs

Latin hypercube designs (LHDs) play an important role when approximating computer simulation models. To obtain good space-filling properties, the maximin criterion is frequently used. Unfortunately, constructing maximin LHDs can be quite time consuming when the number of dimensions and design points increase. In these cases, we can use heuristical maximin LHDs. In this paper, we construct bounds for the separation distance of certain classes of maximin LHDs. These bounds are useful for assessing the quality of heuristical maximin LHDs. Until now only upper bounds are known for the separation distance of certain classes of unrestricted maximin designs, i.e., for maximin designs without a Latin hypercube structure. The separation distance of maximin LHDs also satisfies these “unrestricted” bounds. By using some of the special properties of LHDs, we are able to find new and tighter bounds for maximin LHDs. Within the different methods used to determine the upper bounds, a variety of combinatorial optimization techniques are employed. Mixed-integer programming, the traveling salesman problem, and the graph-covering problem are among the formulations used to obtain the bounds. Besides these bounds, also a construction method is described for generating LHDs that meet Baer's bound for the l∞ distance measure for certain values of n.

[1]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[2]  J. Bermond,et al.  Graph decompositions and G-designs , 1976 .

[3]  J. J. Bisschop,et al.  AIMMS : The Modeling System , 1993 .

[4]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[5]  Raymond H. Myers,et al.  Response Surface Methodology--Current Status and Future Directions , 1999 .

[6]  R JonesDonald,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998 .

[7]  Sonja Kuhnt,et al.  Design and analysis of computer experiments , 2010 .

[8]  Dick den Hertog,et al.  Optimizing color picture tubes by high-cost nonlinear programming , 2002, Eur. J. Oper. Res..

[9]  Jerome Sacks,et al.  Designs for Computer Experiments , 1989 .

[10]  Dick den Hertog,et al.  Space-filling Latin hypercube designs for computer experiments , 2008 .

[11]  B.G.M. Husslage,et al.  Maximin designs for computer experiments , 2006 .

[12]  E. Stinstra.  The meta-model approach for simulation-based design optimization , 2006 .

[13]  L. Driessen.  Simulation-based optimization for product and process design , 2006 .

[14]  N. Oler.  A Finite Packing Problem , 1961, Canadian Mathematical Bulletin.

[15]  Wei Chen,et al.  An Efficient Algorithm for Constructing Optimal Design of Computer Experiments , 2005, DAC 2003.

[16]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[17]  Kenny Q. Ye,et al.  Algorithmic construction of optimal symmetric Latin hypercube designs , 2000 .

[18]  A. Volgenant.  Symmetric traveling salesman problems , 1990 .

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

[20]  Dick den Hertog,et al.  Maximin Latin Hypercube Designs in Two Dimensions , 2007, Oper. Res..

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

[22]  Klaus Hinkelmann,et al.  Design and Analysis of Experiments, Second Edition , 2007 .

[23]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .