A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
From MaRDI portal
Publication:6495533
DOI10.1080/0305215X.2022.2148665MaRDI QIDQ6495533
Guosheng Li, Dequan Zhang, Jiawei Yang, Z. Wu, Wei-Hua Zhang, Patrick N. Okolo
Publication date: 30 April 2024
Published in: Engineering Optimization (Search for Journal in Brave)
Cites Work
- Exploratory designs for computational experiments
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Nested maximin Latin hypercube designs
- Numerical study of nonlinear 2D optimal control problems with multi-term variable-order fractional derivatives in the Atangana-Baleanu-Caputo sense
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- A meshless solution for the variable-order time fractional nonlinear Klein-Gordon equation
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- An algorithm for fast optimal Latin hypercube design of experiments
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- Sequentially Refined Latin Hypercube Designs: Reusing Every Point
- Metamodels for computer-based engineering design: Survey and recommendations
This page was built for publication: A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
