Skip to main content

The Construction of Optimal Design for Order-of-Addition Experiment via Threshold Accepting

  • Chapter
  • First Online:

Abstract

The objective of the order-of-addition (OofA) experiment is to find the optimal addition order by comparing all responses with different orders. Assuming that the OofA experiment involves \(m (\ge 2)\) components, there are m! different orders of adding sequence. When m is large, it is infeasible to compare all m! possible solutions (for example, \(10!\approx 3.6\) millions). Two potential construction methods are systematic combinatorial construction and computer algorithmic search. Computer search methods presented in the literature for constructing optimal fractional designs of OofA experiments appear rather simplistic. In this paper, based on the pairwise-order (PWO) model and the tapered PWO model, the threshold accepting algorithm is applied to construct the optimal design (D-efficiency for the present application) with subsets of size n among all possible size m!. In practical, the designs obtained by threshold accepting algorithm for \(4 \le m\le 30\) with \(n=m(m-1)/2+1, m(m-1)+1, 3m(m-1)/2+1\) respectively are provided for practical uses. This is apparently the most complete list of order-of-addition (OofA) designs via computer search for \(4 \le m\le 30\) in the literature. Their efficiencies are illustrated by a scheduling problem.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Chen, J.B., Han, X.X., Yang, L.Q., Ge, G.N., Zhou, Y.D.: Fractional designs for order of addition experiments. Submitt. Manuscr. (2019)

    Google Scholar 

  2. Chen, J.B., Peng, J.Y., Lin, D.K.J.: A statistical perspective on NP-Hard problems: making uses of design for order-of-addition experiment. Manuscript (2019)

    Google Scholar 

  3. Dueck, G., Scheuer, T.: Threshold accepting: a general purpose algorithm appearing superior to simulated annealing. J. Comput. Phys. 90, 161–175 (1990)

    Article  MathSciNet  Google Scholar 

  4. Fang, K.-T., Lin, D.K.J.: Uniform experimental designs and their applications in industry. In: Khattree, R., Rao, C.R. (eds.) Handbook of Statistics, vol. 22, pp. 131–170. Elsevier, Amsterdam (2003)

    Google Scholar 

  5. Fang, K.-T., Lin, D.K.J., Winker, P., Zhang, Y.: Uniform design: theory and application. Technometrics 42, 237–248 (2000)

    Article  MathSciNet  Google Scholar 

  6. Fang, K.-T., Lu, X., Winker, P.: Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by Threshold Accepting. J. Complex 19, 692–711 (2003)

    Article  MathSciNet  Google Scholar 

  7. Fang, K.-T., Ma, C.-X., Winker, P.: Centered \(L_2\) discrepancy of random sampling and latin hypercube design, and construction of uniform designs. Math. Comput. 71, 275–296 (2002)

    Article  MathSciNet  Google Scholar 

  8. Fang, K.-T., Maringer, D., Tang, Y., Winker, P.: Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels. Math. Comput. 75(254), 859–878 (2005)

    Article  MathSciNet  Google Scholar 

  9. Fang, K.-T., Tang, Y., Yin, J.: Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs. Forthcomming (2004)

    Google Scholar 

  10. Fang, K.-T., Wang, Y.: Applications of Number Theoretic Methods in Statistics. Chapman and Hall, London (1994)

    Book  Google Scholar 

  11. Lenth, R.V.: Quick and easy analysis of unreplicated factorials. Technometrics 31, 469–473 (1989)

    Article  MathSciNet  Google Scholar 

  12. Lin, D.K.J., Sharpe, C., Winker, P.: Optimized U-type designs on flexible regions. Comput. Stat. Data Anal. 54, 1505–1515 (2010)

    Article  MathSciNet  Google Scholar 

  13. Lin, D.K.J., Peng, J.Y.: The order-of-addition experiments: a review and some new thoughts (with discussion). Qual. Eng. 31(1), 49–59 (2019)

    Article  Google Scholar 

  14. Liu, M.Q., Hickernell, F.J.: \(E(s^2)\)-optimality and minimum discrepancy in 2-level superdaturated designs. Statistica Sinica 12, 931–939 (2002)

    MathSciNet  MATH  Google Scholar 

  15. Mee, R.W.: Order of addition modeling. Statistica Sinica. In press (2019)

    Google Scholar 

  16. Pukelsheim, F.: Optimal Design of Experiments. Wiley, New York (1993)

    MATH  Google Scholar 

  17. Peng, J.Y., Mukerjee, R., Lin, D.K.J.: Design of order-of-addition experiments. Biometrika. In press (2019)

    Google Scholar 

  18. Van Nostrand, R.C.: Design of experiments where the order of addition is important. In: ASA Proceedings of the Section on Physical and Engineering Sciences, pp. 155–160. American Statistical Association, Alexandria, Virginia (1995)

    Google Scholar 

  19. Volkel, J.G.: The design of order-of-addition experiments. J. Qual. Technol. (2019) https://doi.org/10.1080/00224065.2019.1569958

    Article  MathSciNet  Google Scholar 

  20. Winker, P.: Optimization Heuristics in Econometrics. Wiley, Chichester (2001)

    MATH  Google Scholar 

  21. Winker, P., Fang, K.-T.: Application of Threshold Accepting to the evaluation of the discrepancy of a set of points. SIAM J. Numer. Anal. 34, 2028–2042 (1997)

    Article  MathSciNet  Google Scholar 

  22. Winker, P., Fang, K.-T.: Optimal \(U\)-type designs. In: Niederreiter, H., Hellekalek, P., Larcher, G., Zinterhof, P. (eds.) Monte Carlo and Quasi-Monte Carlo Methods, pp. 436–488. Springer, New York (1997)

    Google Scholar 

  23. Winker, P., Gilli, M.: Applications of optimization heuristics to estimation and modelling problems. Comput. Stat. Data Anal. 47, 211–223 (2004)

    Article  MathSciNet  Google Scholar 

  24. Yang, J.F., Sun, F.S., Xu, H.: Component orthogonal arrays for order-of-addition experiments. Submitt. Manuscr. (2019)

    Google Scholar 

  25. Zhao, Y.N., Lin, D.K.J., Liu, M.Q.: Minimal-point design for order of addition experiment. Submitt. Manuscr. (2019)

    Google Scholar 

Download references

Acknowledgements

All designs obtained can be found in website: www.jlug.de/optimaloofadesigns. This work was partially supported by the National Science Foundation via Grant DMS 18102925. The work of Jianbin Chen was supported by the National Natural Science Foundation of China (Grant Nos. 11771220). Professor Kai-Tai Fang has been a true leader in our society and has been a strong supporter of young fellows. His original work on uniform design had a significant impact on this work. It is our great privilege to contribute this work on computer experiments to this special issue in honor of his 80th birthday.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dennis K. J. Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Winker, P., Chen, J., Lin, D.K.J. (2020). The Construction of Optimal Design for Order-of-Addition Experiment via Threshold Accepting. In: Fan, J., Pan, J. (eds) Contemporary Experimental Design, Multivariate Analysis and Data Mining. Springer, Cham. https://doi.org/10.1007/978-3-030-46161-4_6

Download citation

Publish with us

Policies and ethics