کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1150319 957922 2006 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A study on algorithms for optimization of Latin hypercubes
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
A study on algorithms for optimization of Latin hypercubes
چکیده انگلیسی

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).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Statistical Planning and Inference - Volume 136, Issue 9, 1 September 2006, Pages 3231–3247
نویسندگان
, ,