Algorithmic Search of Baseline Minimum Aberration Designs


In many practical applications, it is natural to introduce the baseline parameterization if there is a control or baseline level of each factor. In this project, we search for baseline minimum aberration designs of 20 runs. For the number of factors that is smaller or equal to thirteen, we apply the method of complete search. When the number of factors is greater than thirteen, we propose a new search algorithm, which provides tremendous savings in the computing time as compared with the complete search procedure.  The performance of the algorithm is examined, and it is found that our algorithm performs almost as well as the complete search.

Keywords: Baseline Parameterization; Minimum Aberration; Search Algorithm.