A Note on Near-Orthogonal Latin Hypercubes with Good Space-Filling Properties

Abstract

Orthogonal Latin hypercubes (OLHs) are generally inflexible with respect to run sizes and the numbers of factors, and do not guarantee desirable space-filling properties. This article presents a fast algorithm to construct near-OLHs. The constructed near-OLHs achieve near-orthogonality among columns and good space-filling properties. These designs improve those of Cioppa and Lucas (2007) and those constructed by the OA-based approach of Lin et al. (2009) with respect to both orthogonality and space-filling properties.

Keywords:

• 62K99

Keywords:

• Algorithm
• Computer experiments
• Latin squares

Acknowledgment

The authors are grateful to the two referees for helpful comments and corrections of the first draft.