A New Method for Constructing Optimal Design of Computer Experiments

Article Preview

Abstract:

Computer experiments are widely used for the design and development of products. Therefore, a new method for constructing optimal experimental design(SOEDM) is developed in this paper. There are two major developments involved in this work. One is on developing a multi- objective optimal criterion by combining correlation and space-filling criteria. The other is on developing an efficient global optimal search algorithm, named as improved enhanced stochastic evolutionary (IESE) algorithm. Several examples are presented to show: the optimal designs are good in terms of both the correlation and distance criteria, the new method can be used in other experimental designs besides Latin hypercube design the number of levels of each factor is equal to the number of the experimental schemes, and the new algorithm is fast.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

496-504

Citation:

Online since:

December 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. D. Morris, T. J. Mitchell. Exploratory Designs for Computational Experiments. Journal of Statistical Planning and Inference, 43 (1995) 381-402.

DOI: 10.1016/0378-3758(94)00035-t

Google Scholar

[2] K. T. Fang, C. X. Ma, P. Winker. Centered L2-discrepancy of Random Sampling and Latin Hypercube Design, and Constrution of Uniform Designs. Mathematics of Computation, 71 (2002) 275-296.

DOI: 10.1090/s0025-5718-00-01281-3

Google Scholar

[3] K.Q. Ye. Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments. Journal of the American Statistical Association – Theory and Methods, 93 (1998) 1430-1439.

DOI: 10.1080/01621459.1998.10473803

Google Scholar

[4] V. R. Joseph, Y. Hung. Orthogonal-Maximin Latin Hypercube Designs. Statistica Sinica, 18 (2008) 171-186.

Google Scholar

[5] X. L. Liu, B. Guo. Multi-objective Experimentation Design Optimization Based on Modified ESE Algorithms. Systems Engineering and Electronics, 32 (2010) 410-414.

Google Scholar

[6] R. Jin, W. Chen, A. Sudjlanto. An Efficient Algorithm for Constructing Optimal Design of Computer Experiments. Journal of Statistical Planning and Inference, 134 (2005) 268-287.

DOI: 10.1016/j.jspi.2004.02.014

Google Scholar

[7] A. Owen. Orthogonal Arrays for Computer Experiments, Integration and Visualization. Statistica Sinica, 2 (1992) 439-452.

Google Scholar

[8] B. Tang. Orthogonal Array based Latin hypercubes. Journal of the American Statistical Association, 88 (1993) 1392-1397.

DOI: 10.1080/01621459.1993.10476423

Google Scholar

[9] M. E. Johnson, L. M. Morre, D. Ylvisaker. Minimax and Maximum Distance Designs. Journal of Statistical Planning and Inference, 26 (1990) 131-148.

DOI: 10.1016/0378-3758(90)90122-b

Google Scholar

[10] F. J. Hickernell. A Generalized Discrepancy and Quadrature Error Bound. Mathematics of Computation, 67 (1998) 299-322.

DOI: 10.1090/s0025-5718-98-00894-1

Google Scholar

[11] B. G. M. Husslage, G. Rennen, E. R. van Dam, D. den Hertog. Space-filling Latin Hypercube Designs for Computer Experiments. Published with open access at Springerlink.com, (2010).

DOI: 10.2139/ssrn.895464

Google Scholar