首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A study on algorithms for optimization of Latin hypercubes
Institution:1. College of Physics and Electronic Information Engineering, Wenzhou University, Wenzhou, 325035, China;2. Department of Chemical Engineering, Chung Yuan Christian University, Chungli, Taoyuan, Taiwan, 32023, R.O.C.;1. Faculty of Informatics, University of Debrecen, Kassai út 26, H-4028 Debrecen, Hungary;2. Institut für Angewandte Statistik, Johannes Kepler University in Linz, Altenberger Straße 69, A-4040 Linz, Austria;3. Departamento de Matemática, Universidad Técnica Federico Santa María, Casilla 110-V, Valparaíso, Chile
Abstract:A crucial component in the statistical simulation of a computationally expensive model is a good design of experiments. In this paper we compare the efficiency of the columnwise–pairwise (CP) and genetic algorithms for the optimization of Latin hypercubes (LH) for the purpose of sampling in statistical investigations. The performed experiments indicate, among other results, that CP methods are most efficient for small and medium size LH, while an adopted genetic algorithm performs better for large LH.Two optimality criteria suggested in the literature are evaluated with respect to statistical properties and efficiency. The obtained results lead us to favor a criterion based on the physical analogy of minimization of forces between charged particles suggested in Audze and Eglais (1977. Problems Dyn. Strength 35, 104–107) over a ‘maximin distance’ criterion from Johnson et al. (1990. J. Statist. Plann. Inference 26, 131–148).
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号