Creating clear designs: a graph-based algorithm and a catalog of clear compromise plans

Ulrike Grömping

IISE Transactions, 2012, vol. 44, issue 11, 988-1001

Abstract: A graph-based algorithm is proposed for creating regular fractional factorial designs with two-level factors such that a pre-specified set of two-factor interactions is clear of aliasing with any main effects or two-factor interactions (clear design). The Clear Interactions Graph (CIG) used in the algorithm is unique for each design and different in nature from the well-known Taguchi linear graph. Based on published catalogs of two-level fractional factorials, enhanced by the CIG, a search algorithm finds an appropriate clear design or declares its non-existence. The approach is applied to the creation of a catalog of minimum aberration clear compromise plans, which is also of interest in its own right. [Supplementary materials are available for this article. Go to the publisher’s online edition of IIE Transactions for additional discussions on run times and implementation of the algorithm for larger designs.]

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.654848 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:44:y:2012:i:11:p:988-1001

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.654848

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().