An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
From MaRDI portal
Publication:5059304
DOI10.1080/0305215X.2019.1584618OpenAlexW2927575558WikidataQ128107443 ScholiaQ128107443MaRDI QIDQ5059304
No author found.
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2019.1584618
Related Items (2)
Robust optimization of composite cylindrical shell by a trigonometric mixed response surface method ⋮ Algebraic Bayesian networks: checking backbone connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Exploratory designs for computational experiments
- Design optimization of supersonic jet pumps using high fidelity flow analysis
- Optimizing Latin hypercube designs by particle swarm
- Kriging metamodeling in simulation: a review
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Lower bounds of the wrap-around \(L_2\)-discrepancy and relationships between MLHD and uniform design with a large size
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Efficient design of experiments for sensitivity analysis based on polynomial chaos expansions
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization
- Sequential experimental design based generalised ANOVA
- Space-filling Latin hypercube designs for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- A study on algorithms for optimization of Latin hypercubes
- An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Orthogonal Array-Based Latin Hypercubes
- Evolutionary optimization of low-discrepancy sequences
- A novel extension algorithm for optimized Latin hypercube sampling
This page was built for publication: An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
