Construction of Efficient Mixed-Levelk-Circulant Supersaturated Designs

Abstract

An algorithm to construct efficient balanced mixed-level k-circulant supersaturated designs with m factors and n runs is presented in this article. The algorithm generates efficient mixed-level k-circulant supersaturated designs very fast. Using the proposed algorithm many mixed-level, balanced supersaturated designs are constructed and catalogued. A list of many optimal and near optimal, mixed-level supersaturated designs is also provided for m ≤ 60.

Balanced Sampling Plans Excluding Adjacent Units for One Dimentional Population

“…[15]; [13]; [16] and [9] presented algorithms to construct cBSA(N, n, α) for small values of N. Theorem 2 then can be utilized to get bigger cBSA for bigger values of N. However, application of Theorem 2 on a cBSA(N, n, α) with support size b gives a cBSA(N + 2α + 1, n, α) with support size (N +2α+1)b, see [2] for details.…”

“…Existence and construction of cBSA for n = 2 is completely solved by [1] for α = 1 and by [2] for α > 1. For n = 3, existence and construction results of cBSA are available in [3]; [4]; [5]; [6]; [7]; [8] and [9]. [10] and [11] provided solution of cBSA for n = 4 and α = 1.…”