Abstract
Uniformly scatter the design points over the experimental domain is one of the most widely used techniques to construct optimal designs (called, uniform designs) for real-world high-dimensional experiments with limited resources and without model pre-specification. Uniform designs are robust to the underlying model assumption and thus experimenters do not need to specify the models of their experiments in advance before conducting them. A uniform design affords a good design space coverage that yields more accurate approximations globally using fewer experimental trials. The construction of uniform designs is a significant challenge due to the computational complexity. The existing techniques are extremely time-consuming (heuristic search techniques), difficult for non-mathematicians experimenters, and optimal results are not guaranteed. This paper tries to help non-mathematicians experimenters by providing a simple non-heuristic search technique for constructing uniform designs for experiments with a mixture of two- and four-level factors. The efficiency of the new technique is investigated theoretically and numerically. A comparison study between the new technique and the existing techniques is given. Furthermore, the applicability of the new technique for real-world applications is discussed and demonstrated by two real industrial experiments. The results show that the new designs that are generated by the new technique are better than the existing recommended designs.
Similar content being viewed by others
References
Ankenman, B. E. (1999). Design of experiments with two- and four-level factors. Journal of Quality Technology, 31(4), 363–375.
Cheng, C. S., Steinberg, D. M., & Sun, D. X. (1999). Minimum aberration and model robustness for two-level fractional factorial designs. The Journal of the Royal Statistical Society, Series B, 61, 85–93.
Cheng, C. S., Deng, L. Y., & Tang, B. (2002). Generalized minimum aberration and design efficiency for nonregular fractional factorial designs. Statistica Sinica, 12, 991–1000.
Elsawah, A. M. (2016). Constructing optimal asymmetric combined designs via Lee discrepancy. Statistics and Probability Letters, 118, 24–31.
Elsawah, A. M. (2019a). Designing uniform computer sequential experiments with mixture levels using Lee discrepancy. Journal of Systems Science and Complexity, 32(2), 681–708.
Elsawah, A. M. (2019b). Constructing optimal router bit life sequential experimental designs: New results with a case study. Communications in Statistics, Simulation and Computation, 48(3), 723–752.
Elsawah, A. M., & Fang, K. T. (2019). A catalog of optimal foldover plans for constructing U-uniform minimum aberration four-level combined designs. Journal of Applied Statistics, 46(7), 1288–1322.
Elsawah, A. M. (2020). Building some bridges among various experimental designs. The Journal of the Korean Statistical Society, 49, 55–81.
Elsawah, A. M. (2021a). Designing optimal large four-level experiments: A new technique without recourse to optimization softwares. Communications in Mathematics and Statistics. https://doi.org/10.1007/s40304-021-00241-y.
Elsawah, A. M. (2021b). Multiple doubling: A simple effective construction technique for optimal two-level experimental designs. Statist Papers, 62(6), 2923–2967.
Elsawah, A. M. (2021c). An appealing technique for designing optimal large experiments with three-level factors. Journal of Computational and Applied Mathematics, 384, 113164.
Elsawah, A. M., & Fang, K. T. (2018). New results on quaternary codes and their Gray map images for constructing uniform designs. Metrika, 81(3), 307–336.
Elsawah, A. M., & Qin, H. (2017a). A new look on optimal foldover plans in terms of uniformity criteria. Communications in Statistics: Theory and Methods, 46(4), 1621–1635.
Elsawah, A. M., & Qin, H. (2017b). Optimum mechanism for breaking the confounding effects of mixed-level designs. Computational Statistics, 32(2), 781–802.
Elsawah, A. M., & Qin, H. (2016). An efficient methodology for constructing optimal foldover designs in terms of mixture discrepancy. Journal of the Korean Statistical Society, 45, 77–88.
Elsawah, A. M., & Qin, H. (2015). A new strategy for optimal foldover two-level designs. Statistics and Probability Letters, 103, 116–126.
Elsawah, A. M., Fang, K. T., He, P., & Qin, H. (2021). Sharp lower bounds of various uniformity criteria for constructing uniform designs. Statistics Papers, 62, 1461–1482.
Fang, K. T. (1980). The uniform designs: Application of number-theoretic methods in experimental design. Acta Mathematicae Applicatae Sinica, 3, 363–372.
Fang, K. T., & Hickernell, F. J. (1995). The uniform design and its applications. Bulletin de l’Institut international de statistique, 1, 333–349.
Fang, K. T., Ke, X., & Elsawah, A. M. (2017). Construction of uniform designs via an adjusted threshold accepting algorithm. Journal of Complexity, 43, 28–37.
Fang, K. T., & Li, R. (2006). Uniform design for computer experiments and its optimal properties. International Journal of Materials and Product Technology, 25(1/2/3), 198–210.
Fang, K. T., Lin, D. K. J., Winker, P., & Zhang, Y. (2000). Uniform design: Theory and application. Technometrics, 42, 237–248.
Fries, A., & Hunter, W. G. (1980). Minimum Aberration \(2^{k-p}\) Designs. Technometrics, 22, 601–608.
Hickernell, F. J. (1998a). A generalized discrepancy and quadrature error bound. Mathematics of Computation, 67, 299–322.
Hickernell, F.J. (1998b). Lattice rules: how well do they measure up? In: Hellekalek, P., Larcher, G. (Eds.), Random and Quasi-Random Point Sets. In Lecture Notes in Statistics, vol. 138. Springer, New York, (pp. 109–166). (pp. 109–166).
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990). Minimax and maximin distance design. Journal of Statistical Planning and Inference, 26, 131–148.
Ma, C. X., & Fang, K. T. (2001). A note on generalized aberration in factorial designs. Metrika, 53, 85–93.
Montgomery, D. C. (1997). Design and Analysis of Experiments (4th ed.). New York, NY: John Wiley.
Mukerjee, R., & Wu, C. F. J. (1995). On the existence of saturated and nearly saturated asymmetrical orthogonal arrays. Annals of Statistics, 23(6), 2102–15.
Phadke, M. S. (1986). Design optimization case studies. AT& T Technical Journal, 65, 51–68.
Simpson, T. W., Lin, D. K. J., & Chen, W. (2001). Sampling strategies for computer experiments: Design and analysis. International Journal of Reliability and Applications, 2(3), 209–240.
Taguchi, G. (1987). System Of Experimental Design (Vol. 1). White Plains, NY: Unipub/Kraus International Publications.
Tang, B., & Deng, L. Y. (1999). Minimum G2-aberration for non-regular fractional factorial designs. Annals of Statistics, 27, 1914–1926.
Wang, Y., & Fang, K. T. (1981). A not on uniform distribution and experimental design. Chinese Science Bulletin, 26(764), 485–489.
Weng, L. C., Elsawah, A. M., & Fang, K. T. (2021). Cross-entropy loss for recommending efficient fold-over technique. Journal of Systems Science and Complexity, 34, 402–439.
Winker, P., & Fang, K. T. (1997). Optimal U-type designs. In H. Niederreiter, P. Hellekalek, G. Larcher, & P. Zinterhof (Eds.), Monte Carlo and Quasi-Monte Carlo Methods (pp. 436–488). New York: Springer.
Xu, H., & Wu, C. F. J. (2001). Generalized minimum aberration for asymmetrical fractional factorial designs. Annals of Statistics, 29, 549–560.
Xu, H. (2003). Minimum moment aberration for nonregular designs and supersaturated designs. Statistica Sinica, 13, 691–708.
Yang, F., Zhou, Y. D., & Zhang, X. R. (2017). Augmented uniform designs. Journal of Statistical Planning and Inference, 182, 61–73.
Yang, F., Zhou, Y. D., & Zhang, A. J. (2019). Mixed-level column augmented uniform designs. Journal of Complexity, 53, 23–39.
Zhou, Y. D., Ning, J. H., & Song, X. B. (2008). Lee discrepancy and its applications in experimental designs. Statistics and Probability Letters, 78, 1933–1942.
Acknowledgements
The author thank the two referees, Associate Editor and the Editor in Chief Professor Hee-Seok Oh for constructive comments that lead to significant improvements of this paper. The author also would like to thank Prof. Kai-Tai Fang for his kind support during this work. This work was partially supported by the UIC Grants (Nos. R201810, R201912 and R202010).
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Proof of Theorem 1
For any design \(\Gamma =(\gamma _{ik})_{i=1,k=1}^{a,b}\), define the following distances among its runs \(D^{\ne 0}_{ij}(\Gamma )=\sharp \{k:|\gamma _{ik}-\gamma _{jk}|\ne 0\}\) and \(D^{=2}_{ij}(\Gamma )=\sharp \{k:|\gamma _{ik}-\gamma _{jk}|=2\}\), and let \(i^{\star } =i-2^{t-1}n,\) \(j^{\star } =j-2^{t-1}n\) and \(C_a^b= \{a,a+1,\ldots ,b\}.\) From the construction procedures in Sect. 3 (cf. Step 4) with some algebra, we get the following relationships between the extended designs and their images
For any t-image design \(\mathbf{Z}^{(t)}=\left(\mathbf{Z}^{(t)}_1\,~\,\mathbf{Z}^{(t)}_2\right)=\left(z^{(t)}_{ik}\right)_{i=1,k=1}^{2^tn,2^{t}s_1+2^{t-1}s_2}\in U\left(2^tn,2^{2^{t}s_1}4^{2^{t-1}s_2}\right)\) with \(2^tn\) runs and a mixture of \(2^{t}s_1\) factors with two levels \(z^{(t)}_{ik_1}\in \{-1,1\},\,1\le i\le 2^tn,\,1\le k_1\le 2^{t}s_1\) and \(2^{t-1}s_2\) factors with four levels \(z^{(t)}_{ik_2}\in \{1,2,3,4\},\,1\le i\le 2^tn,\,2^{t}s_1+1\le k_2\le 2^{t-1}s_2,\) let \(z^{(t)}_{ijk_1}=z^{(t)}_{ik_1}- z^{(t)}_{jk_1}\) and \(z^{(t)}_{ijk_2}=z^{(t)}_{ik_2}- z^{(t)}_{jk_2}.\) Then, the analytical expressions of the discrepancies WD and LD in (4) and (5) can be rewritten in the following formulas, respectively
and
For any factor with four levels \(z^{(t)}_{ik_2}\in \{1,2,3,4\}\) with some algebra, we get
For any factor with two levels \(z^{(t)}_{ik_1}\in \{-1,1\}\) with some algebra, we get
From (11)–(14), the formulas (9) and (10) of the discrepancies WD and LD can be rewritten in the following efficient analytical expressions, respectively
and
From (6)–(8), the sum term in (15) can be written as follows
By the same technique, the sum term in (16) can be written as follows
From Theorem 1 in Elsawah (2021b) with some algebra, we get the following relationship between the dissimilarity among the runs of any sub-design \(\mathbf{X}_\sigma \in U(n,2^{s_\sigma }),\,\sigma =1,2\) and its corresponding extended design \(E^{(t-1)}(\mathbf{X}_\sigma )\in U\left(2^{t-1}n,2^{2^{t-1}s_\sigma }\right)\)
From (19), the sum in (17) can be rewritten as follows
By the same technique, the sum term in (18) can be written as
Combining (15)–(18) and (20)–(21) with some algebra, the proof can be completed. \(\square\)
Proof of Corollary 1
The proof is obvious from Theorem 1, where
\(\square\)
Proof of Corollary 2
Since the base design \(\mathbf{X}\) is a saturated orthogonal design \(\mathbf{X}\in SOD(n,2^{s}),\) then \(h_{ij}(\mathbf{X})=\frac{n}{2}\) for any \(i\ne j\) (cf. Mukerjee and Wu 1995). From Theorem 1 and (22), the proof can be completed. \(\square\)
Proof of Corollary 3
The proof is obvious from the proof of Corollary 2. \(\square\)
Proof of Theorem 2
From the definition of \(H_{\mu _1,\mu _2}(\mathbf{X}),\) we get
From Theorem 1 and (23), the proof can be completed. \(\square\)
Proof of Corollary 4
The proof can be obtained from Corollary 1 by the same technique of (23). \(\square\)
Proof of Corollary 5
For any design without replicates \(\mathbf{X}_1\in U(n,2^{s_1}),\) we get \(h_{ij}(\mathbf{X}_1)=0\) for only \(i=j\) and thus we get
The proof can be completed from Corollary 2 and (24). \(\square\)
Proof of Corollary 6
The proof is obvious from Corollary 3 by the same way of (24). \(\square\)
Proof of Theorem 3
By the same technique of Theorem 2 in Elsawah (2020) with some algebra, the inverse of the MacWilliam transformations is given as follows
From (25), we get
From the orthogonality property of the Krawtchouk polynomials, we get
Combining (26) and (27), we get
Combining Theorem 2 and (28), the proof can be completed. \(\square\)
Proof of Corollary 7
The proof can be obtained from Corollary 4 by the same technique of the proof of Theorem 3. \(\square\)
Proof of Corollary 8
From the definition of the Krawtchouk polynomials, we get
The proof can be obtained from Corollary 5 and (30). \(\square\)
Proof of Corollary 9
From Corollary 6 by the same technique of Corollary 8. \(\square\)
Proof of Theorem 4
From the definition of the MAP in (3), we get
Combining Corollary 1 and (31), the proof can be completed. \(\square\)
Proof of Corollary 10
From Corollary 2 by the same technique of Theorem 4. \(\square\)
Proof of Corollary 11
From Corollary 3 by the same technique of Theorem 4. \(\square\)
Proof of Theorem 5
From (15) and (16) with some algebra, we can get the following analytical framework for any of the above-mentioned discrepancies (WD and LD) of the design \(\mathbf{Z}^{(t)}\in U\left(2^tn,2^{2^{t}s_1}4^{2^{t-1}s_2}\right)\)
From Lemmas 5 and 6 in Elsawah et al. (2021), for any two nonnegative sequences with \(\sum _{i=1}^{c}A_{i} = a,\,\sum _{i=1}^{c}B_{i} = b\) and \(\tau _i>1,\,i=1,2\) we have
and
respectively, where \(\phi _1=c\left( \lfloor \frac{a}{c}\rfloor -\frac{a}{c}+1\right) ,\) \(\phi _2=c\left( \lfloor \frac{b}{c}\rfloor -\frac{b}{c}+1\right) ,\) \(z_i = \ln \left( \tau _1^{A_i}\tau _2^{B_i}\right) ,\) \(\omega\) is the largest integer such that \(\vartheta _{(\omega )}\le \frac{a \ln \tau _1+b \ln \tau _2}{c}< \vartheta _{(\omega +1)}\) and \(p=\frac{c}{\vartheta _{(\omega +1)}-\vartheta _{(\omega )}}\left( \vartheta _{(\omega +1)}-\frac{a \ln \tau _1+b \ln \tau _2}{c}\right) .\) From the definitions of \(\xi _{ij}\) and \(\zeta _{ij}\) with some algebra, we get
Combining (32)–(36) with some algebra, the proof can be obtained. \(\square\)
Proof of Theorem 6
From Lemma 4 in Elsawah and Qin (2015), for any nonnegative sequence with \(\sum _{i=1}^{c}V_{i} = v\) and \(\varepsilon >1,\) we have
where \(\varpi =c\left( \lfloor \frac{v}{c}\rfloor -\frac{v}{c}+1\right) .\) From the definitions of \(\xi _{ij}\) with some algebra, we get
Combining Corollary 1, (34), (37) and (38) with some algebra, the proof can be obtained. \(\square\)
Proof of Corollary 12
The proof can be obtained from Corollary 8 and the fact that for any orthogonal array of strength \(s_1\) \(\mathbf{X}_1\in U(n,2^{s_1})\) we get \(W_\delta (\mathbf{X}_1)=0,\,1\le \delta \le s_1.\) \(\square\)
Proof of Corollary 13
From Corollary 9 by the same technique of Corollary 12. \(\square\)
Proof of Corollary 14
From Theorem 1 by the same way of the proof of Corollary 2. \(\square\)
Proof of Corollary 15
From (4) and (5) with some algebra, we get the following formulas of the WD and LD of the extended design \(E^{(t-1)}(\mathbf{X}_2)\in U(2^{t-1}n,2^{2^{t-1}s})\)
Combining (15)–(18), (39) and (40) with some algebra, the proof can be completed. \(\square\)
Proof of Corollary 16
The proof is obvious from Corollary 15 by taking \(t=1\) and the fact that any full factorial design in \(U(2^s,2^s)\) has \(\hbox {LD-value}=0.\) \(\square\)
Proof of Theorem 7
From (32) with some algebra, we can get the following analytical framework for any of the above-mentioned discrepancies (WD and LD) of the design \(\mathbf{Z}^{(t)}_{Flex}\in U\left(2^tn+n_1,2^{2^{t}s_1+m_1}4^{2^{t-1}s_2+m_2}\right)\)
The sum term in (41) can be rewritten as follows
From (41) with some algebra, we get
From (41)–(44) with some algebra, the proof can be completed. \(\square\)
Proof of Theorem 8
The proof can be obtained from Theorem 7 by the same technique of the proof of Theorem 5. \(\square\)
Rights and permissions
About this article
Cite this article
Elsawah, A.M. A novel non-heuristic search technique for constructing uniform designs with a mixture of two- and four-level factors: a simple industrial applicable approach. J. Korean Stat. Soc. 51, 716–757 (2022). https://doi.org/10.1007/s42952-021-00159-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s42952-021-00159-9
Keywords
- Threshold accepting algorithm
- Coding scheme
- Gray map
- Design without replicates
- Saturated orthogonal design
- Uniform design
- Aberration
- Moment aberration
- Hamming distance