An Improved Algorithm for Constructing Large Fractional Factorial Designs
Bouchra El Boujdaini1, Driss Driouchi2
1Bouchra El Boujdaini*, Department of Mathematics, University of Med 1, Oujda, Morocco.
2Driss Driouchi, Department of Mathematics, University of Med 1, Oujda,Morocco.
Manuscript received on December 16, 2019. | Revised Manuscript received on December 22, 2019. | Manuscript published on January 10, 2020. | PP: 30-33 | Volume-9 Issue-3, January 2020. | Retrieval Number: B7587129219/2020©BEIESP | DOI: 10.35940/ijitee.B7587.019320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Fractional factorial designs (FF-Designs) are widely used in various engineering, industrial and scientific areas for their run size economy and cost-effective.A complete catalogue of FF-Designs provide a helpful way for experimenters to choose best designs,in this paper we introduce an improved algorithm for constructing the set of all non-isomorphic 2-level regular FF-Designs by developing a new sequential generation procedure that reduce significantly the number of candidate designs from which isomorphs need to be removed, to illustrate the efficiency of the proposed method some comparisons with existing generation procedure are given.The present algorithm is able to enumerate all 16384-run and all 32768-run designs with resolution 9, we extend the catalog by all 65536-run designs with resolution 10, all 131072-run designs with resolution 10 up to 22 factors, all 262144-run designs with resolution 11 and all 524288-run designs with resolution 12, which were not generated in literature.
Keywords: Automorphism, Isomorphism, Minimum Aberration, Resolution, World Length Pattern
Scope of the Article: Algorithm Engineering