Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1148105 | Journal of Statistical Planning and Inference | 2009 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Luis B. Morales,