Optimizing Latin hypercube designs by particle swarm
From MaRDI portal
Publication:746308
DOI10.1007/s11222-012-9363-3zbMath1322.90005OpenAlexW2039274163MaRDI QIDQ746308
Ray-Bing Chen, Ying Hung, Dai-Ni Hsieh, Wei-Chung Wang
Publication date: 16 October 2015
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/271295/1/index.html
Optimal statistical designs (62K05) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (15)
Space-filling experimental designs for constrained design spaces ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ A fast optimal Latin hypercube design method using an improved translational propagation algorithm ⋮ Optimizing two-level orthogonal arrays for simultaneously estimating main effects and pre-specified two-factor interactions ⋮ Robust optimization of composite cylindrical shell by a trigonometric mixed response surface method ⋮ Group symmetric Latin hypercube designs for symmetrical global sensitivity analysis ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Optimal maximin \(L_2\)-distance Latin hypercube designs ⋮ Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections ⋮ Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs ⋮ Latin hypercube designs based on strong orthogonal arrays and Kriging modelling to improve the payload distribution of trains
Uses Software
Cites Work
- Unnamed Item
- Exploratory designs for computational experiments
- Finding maximin Latin hypercube designs by iterated local search heuristics
- The design and analysis of computer experiments.
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- An efficient algorithm for constructing optimal design of computer experiments
- A study of particle swarm optimization particle trajectories
- A study on algorithms for optimization of Latin hypercubes
- Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- Accelerating parallel particle swarm optimization via GPU
- Bounds for Maximin Latin Hypercube Designs
- Maximin Latin Hypercube Designs in Two Dimensions
- An algorithm for fast optimal Latin hypercube design of experiments
- Orthogonal Array-Based Latin Hypercubes
- Predicting the output from a complex computer code when fast approximations are available
This page was built for publication: Optimizing Latin hypercube designs by particle swarm
