کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1148105 | 957819 | 2009 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolvable difference families which lead to an equal number of new 1-rotational near resolvable block designs with parameters: (46,9,8), (51,10,9) and (55,9,8). Our results indicate that this conjunction outperforms both scatter search and tabu search.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Statistical Planning and Inference - Volume 139, Issue 1, January 2009, Pages 62-68
Journal: Journal of Statistical Planning and Inference - Volume 139, Issue 1, January 2009, Pages 62-68
نویسندگان
Luis B. Morales,