Searching for optimal Latin hypercube designs by a local greedy strategy

doi:10.1080/03610918.2023.2240047

CIOMP OpenIR

	Searching for optimal Latin hypercube designs by a local greedy strategy
	X. Zhou, X. Wang and B. Wang
	2023
ISSN	03610918
摘要	The Latin hypercube design (LHD), because of its one-dimensional projection uniformity, is commonly used in computer experiment. The randomly generated LHD may have too many concentrated design points, and factors may be highly correlated. In this article, we suggested a local greedy strategy for searching optimal LHDs. Our strategy consists of two parts. One is a swap process for doing a local greedy search in a polynomial time. The other is a simulated annealing process for jumping out of the possible local optima. Our strategy is flexible and adapts to various space-filling criteria of LHDs. The simulated experiments illustrated that our proposed algorithm can produce LHDs with well space-filling property and orthogonality. Compared to other classical design algorithms, our algorithm performed better on the criteria related to the point distance and the column correlation. Moreover, for the response surface approximation, the Kriging model using our produced optimal LHD performed more robust on the surface prediction. © 2023 Taylor & Francis Group, LLC.
DOI	10.1080/03610918.2023.2240047
URL	查看原文
收录类别	sci ; ei
引用统计
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/68273
专题	中国科学院长春光学精密机械与物理研究所
推荐引用方式 GB/T 7714	X. Zhou, X. Wang and B. Wang. Searching for optimal Latin hypercube designs by a local greedy strategy[J],2023.
APA	X. Zhou, X. Wang and B. Wang.(2023).Searching for optimal Latin hypercube designs by a local greedy strategy..
MLA	X. Zhou, X. Wang and B. Wang."Searching for optimal Latin hypercube designs by a local greedy strategy".(2023).

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Searching for optima（1488KB）	期刊论文	出版稿	开放获取	CC BY-NC-SA	浏览请求全文