Finding maximin Latin hypercube designs by iterated local search heuristics
From MaRDI portal
Publication:1014951
DOI10.1016/j.ejor.2008.07.028zbMath1159.90523OpenAlexW2055432781MaRDI QIDQ1014951
Andrea Grosso, Marco Locatelli, A. R. M. J. U. Jamali
Publication date: 30 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.028
Related Items
Surrogate‐based methods for black‐box optimization ⋮ Asymptotically optimal maximin distance Latin hypercube designs ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Nested maximin Latin hypercube designs ⋮ Maximin \(L_1\)-distance range-fixed level-augmented designs ⋮ Dynamic simulation metamodeling using Mars: a case of radar simulation ⋮ An algorithm for fast optimal Latin hypercube design of experiments ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ A critical appraisal of design of experiments for uncertainty quantification ⋮ Maximin distance designs based on densest packings ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Simplex based space filling designs ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distribution-free approach to inducing rank correlation among input variables
- Exploratory designs for computational experiments
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Optimal Latin-hypercube designs for computer experiments
- The design and analysis of computer experiments.
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Optimizing color picture tubes by high-cost nonlinear programming
- Space-filling Latin hypercube designs for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Maximin Latin Hypercube Designs in Two Dimensions
- Controlling Correlations in Latin Hypercube Samples
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
