×

zbMATH — the first resource for mathematics

Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm. (English) Zbl 1342.62132
Summary: We focus on the D-optimal design of screening experiments involving main-effects regression models, especially with large numbers of factors and observations. We propose a new selection strategy for the coordinate-exchange algorithm based on an orthogonality measure of the design. Computational experiments show that this strategy finds better designs within an execution time that is 30 % shorter than other strategies. We also provide strong evidence that the use of the prediction variance as a selection strategy does not provide any added value in comparison to simpler selection strategies. Additionally, we propose a new iterated local search algorithm for the construction of D-optimal experimental designs. This new algorithm outperforms the original coordinate-exchange algorithm.

MSC:
62K05 Optimal statistical designs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Arnouts, H; Goos, P, Update formulas for split-plot and block designs, Comput. Stat. Data Anal., 54, 3381-3391, (2010) · Zbl 1284.62485
[2] Atkinson, AC; Donev, AN, The construction of exact D-optimum experimental designs with application to blocking response surface designs, Biometrika, 76, 515, (1989) · Zbl 0677.62066
[3] Atkinson, A.C., Donev, A.N., Tobias, R.: Optimum Experimental Designs, with SAS, vol. 34. Oxford University Press, Oxford (2007) · Zbl 1183.62129
[4] Booth, KHV; Cox, DR, Some systematic supersaturated designs, Technometrics, 4, 489-495, (1962) · Zbl 0109.12201
[5] Borkowski, JJ, Using a genetic algorithm to generate small exact response surface designs, J. Probab. Stat. Sci., 1, 65-88, (2003)
[6] Cawse, JN; Cawse, JN (ed.), The combinatorial challenge, 1-26, (2003), Hoboken, NJ
[7] Cook, RD; Nachtsheim, CJ, A comparison of algorithms for constructing exact D-optimal designs, Technometrics, 22, 315-324, (1980) · Zbl 0459.62061
[8] Davis, L. (ed.): Handbook of Genetic Algorithms, vol. 115. Van Nostrand Reinhold, New York (1991)
[9] Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, New York (1972)
[10] Glover, FW, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res., 13, 533-549, (1986) · Zbl 0615.90083
[11] Goos, P; Vandebroek, M, D-optimal split-plot designs with given numbers and sizes of whole plots, Technometrics, 45, 235-245, (2003)
[12] Goos, P., Jones, B.: Optimal Design of Experiments: A Case Study Approach. Wiley, New York (2011)
[13] Haines, LM, The application of the annealing algorithm to the construction of exact optimal designs for linear-regression models, Technometrics, 29, 439-447, (1987) · Zbl 0632.62071
[14] Heredia-Langner, A; Carlyle, WM; Montgomery, DC; Borror, CM; Runger, GC, Genetic algorithms for the construction of D-optimal designs, J. Qual. Technol., 35, 28-46, (2003)
[15] Johnson, M.E., Nachtsheim, C.J.: Some guidelines for constructing exact D-optimal designs on convex design spaces. Technometrics 25(3), 271-277 (1983) · Zbl 0526.62070
[16] Jones, B.: Computer aided designs for practical experimentation. Ph.D. thesis, University of Antwerp, Faculty of Applied Economics (2008) · Zbl 0900.62416
[17] Kirkpatrick, S; Gelatt, CD; Vecchi, MP, Optimization by simulated annealing, Science, 220, 671, (1983) · Zbl 1225.90162
[18] Lejeune, MA, Heuristic optimization of experimental designs, Eur. J. Oper. Res., 147, 484-498, (2003) · Zbl 1037.90058
[19] Li, WW; Wu, CFJ, Columnwise-pairwise algorithms with applications to the construction of supersaturated designs, Technometrics, 39, 171-179, (1997) · Zbl 0889.62066
[20] Lourenco, HR; Martin, OC; Stützle, T; Glover, F (ed.); Kochenberger, GA (ed.), Iterated local search, 320-353, (2003), Berlin · Zbl 1116.90412
[21] Mandal, BN; Koukouvinos, C, Optimal multi-level supersaturated designs through integer programming, Stat. Probab. Lett., 84, 183-191, (2014) · Zbl 1288.62115
[22] Meyer, RK; Nachtsheim, CJ, Simulated annealing in the construction of exact optimal design of experiments, Am. J. Math. Manag. Sci., 8, 329-359, (1988) · Zbl 0676.65148
[23] Meyer, RK; Nachtsheim, CJ, The coordinate-exchange algorithm for constructing exact optimal experimental designs, Technometrics, 37, 60-69, (1995) · Zbl 0825.62652
[24] Michalewicz, Z., Fogel, D.B.: How to solve it: modern heuristics. Springer, New York (2004) · Zbl 1058.68105
[25] Mitchell, T.J.: Computer construction of “D-optimal” first-order designs. Technometrics 16(1), 211-220 (1974) · Zbl 0299.62040
[26] Mitchell, T.J.: An algorithm for the construction of “D-optimal” experimental designs. Technometrics 16(2), 203-210 (1974) · Zbl 0297.62055
[27] Montepiedra, G; Myers, D; Yeh, AB, Application of genetic algorithms to the construction of exact D-optimal designs, J. Appl. Stat., 25, 817-826, (1998) · Zbl 0933.62063
[28] Montgomery, DC; Jennings, CL; Dean, A (ed.); Lewis, S (ed.), An overview of industrial screening experiments, 1-20, (2006), New York
[29] Montgomery, D.C.: Design and Analysis of Experiments. Wiley, New York (2008)
[30] Nguyen, NK; Miller, AJ, A review of some exchange algorithms for constructing discrete D-optimal designs, Comput. Stat. Data Anal., 14, 489-498, (1992) · Zbl 0937.62628
[31] Nguyen, NK, An algorithmic approach to constructing supersaturated designs, Technometrics, 38, 69-73, (1996) · Zbl 0900.62416
[32] Plackett, RL; Burman, JP, The design of optimum multifactorial experiments, Biometrika, 33, 305-325, (1946) · Zbl 0063.06274
[33] Sörensen, K; Glover, F; Gass, S (ed.); Fu, M (ed.), Metaheuristics, (2013), London · Zbl 1353.90005
[34] Sung Jung, J; Jin Yum, B, Construction of exact D-optimal designs by tabu search, Comput. Stat. Data Anal., 21, 181-191, (1996) · Zbl 0900.62403
[35] Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009) · Zbl 1190.90293
[36] Trinca, L.A., Gilmour, S.G.: An algorithm for arranging response surface designs in small blocks. Comput. Stat. Data Anal. 33(1), 25-43 (2000). Erratum 40(3), 475 (2002) · Zbl 1061.62551
[37] Welch, WJ, Algorithmic complexity: three NP-hard problems in computational statistics, J. Stat. Comput. Simul., 15, 17-25, (1982) · Zbl 0482.65080
[38] Wu, C.F.J., Hamada, M.: Experiments: Planning, Analysis, and Parameter Design Optimization. Wiley, New York (2000) · Zbl 0964.62065
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.