Comparison among algorithms for sequencing runs of the full 2ⁿ factorial experiment
by Hisham Hilow
International Journal of Experimental Design and Process Optimisation (IJEDPO), Vol. 3, No. 4, 2013

Abstract: The complete 2ⁿ factorial experiment has 2ⁿ different experimental runs among which there are 2ⁿ! permutations for carrying out this experiment sequentially one run at a time, but not all of these permutations produce runs sequences with desirable properties. There are four algorithms for sequencing runs of the 2ⁿ factorial experiment such that: 1) main effects and/or two-factor interactions are orthogonal to the linear/quadratic time trend and/or such that; 2) the total number of factor level changes between the 2ⁿ runs (i.e., the cost) is minimal. These algorithms are: Correa et al. (2009), Cui and John (1998), Cheng and Jacroux (1988) and Coster and Cheng (1988), referred to here as Algorithms 1, 2, 3(a) and 3(b) and 4, respectively. This paper conducts a comparison among these algorithms and documents their differences according to the three criteria: 1) which algorithm produces runs sequences in a less number of factor level changes (i.e., less costly); 2) which algorithm produces runs sequences with more linear/quadratic time trend free main effects and/or two-factor interactions; 3) which runs sequence of an algorithm can be generated by another algorithm using the generalised fold-over scheme or the interactions-main effects assignment. Results of this comparison are summarised in Section 4.

Online publication date: Wed, 02-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Experimental Design and Process Optimisation (IJEDPO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com