Algorithmic construction of optimal symmetric Latin hypercube designs

Qian K. Ye, William Li, Agus Sudjianto

Research output: Contribution to journalArticle

338 Citations (Scopus)

Abstract

We propose symmetric Latin hypercubes for designs of computer experiment. The goal is to offer a compromise between computing effort and design optimality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin hypercube designs. This algorithm is compared with two existing algorithms by Park (1994. J. Statist. Plann. Inference 39, 95-111) and Morris and Mitchell (1995. J. Statist. Plann. Inference 43, 381-402). Some examples, including a real case study in the automotive industry, are used to illustrate the performance of the new designs and the algorithms.

Original languageEnglish (US)
Pages (from-to)145-159
Number of pages15
JournalJournal of Statistical Planning and Inference
Volume90
Issue number1
StatePublished - Sep 1 2000
Externally publishedYes

Fingerprint

Latin Hypercube Design
Symmetric Design
Latin Hypercube
Exchange Algorithm
Computer Experiments
Minimum Distance
Optimality
Entropy
Industry
Automotive industry
Design
Computing

Keywords

  • Computer experiment
  • Maximin design
  • Maximum entropy design

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Statistics and Probability

Cite this

Algorithmic construction of optimal symmetric Latin hypercube designs. / Ye, Qian K.; Li, William; Sudjianto, Agus.

In: Journal of Statistical Planning and Inference, Vol. 90, No. 1, 01.09.2000, p. 145-159.

Research output: Contribution to journalArticle

@article{7467547eed0540e2a95523c09d3fde71,
title = "Algorithmic construction of optimal symmetric Latin hypercube designs",
abstract = "We propose symmetric Latin hypercubes for designs of computer experiment. The goal is to offer a compromise between computing effort and design optimality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin hypercube designs. This algorithm is compared with two existing algorithms by Park (1994. J. Statist. Plann. Inference 39, 95-111) and Morris and Mitchell (1995. J. Statist. Plann. Inference 43, 381-402). Some examples, including a real case study in the automotive industry, are used to illustrate the performance of the new designs and the algorithms.",
keywords = "Computer experiment, Maximin design, Maximum entropy design",
author = "Ye, {Qian K.} and William Li and Agus Sudjianto",
year = "2000",
month = "9",
day = "1",
language = "English (US)",
volume = "90",
pages = "145--159",
journal = "Journal of Statistical Planning and Inference",
issn = "0378-3758",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Algorithmic construction of optimal symmetric Latin hypercube designs

AU - Ye, Qian K.

AU - Li, William

AU - Sudjianto, Agus

PY - 2000/9/1

Y1 - 2000/9/1

N2 - We propose symmetric Latin hypercubes for designs of computer experiment. The goal is to offer a compromise between computing effort and design optimality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin hypercube designs. This algorithm is compared with two existing algorithms by Park (1994. J. Statist. Plann. Inference 39, 95-111) and Morris and Mitchell (1995. J. Statist. Plann. Inference 43, 381-402). Some examples, including a real case study in the automotive industry, are used to illustrate the performance of the new designs and the algorithms.

AB - We propose symmetric Latin hypercubes for designs of computer experiment. The goal is to offer a compromise between computing effort and design optimality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin hypercube designs. This algorithm is compared with two existing algorithms by Park (1994. J. Statist. Plann. Inference 39, 95-111) and Morris and Mitchell (1995. J. Statist. Plann. Inference 43, 381-402). Some examples, including a real case study in the automotive industry, are used to illustrate the performance of the new designs and the algorithms.

KW - Computer experiment

KW - Maximin design

KW - Maximum entropy design

UR - http://www.scopus.com/inward/record.url?scp=0034259082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034259082&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034259082

VL - 90

SP - 145

EP - 159

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

SN - 0378-3758

IS - 1

ER -