Optimizing Latin hypercube designs by particle swarm
From MaRDI portal
(Redirected from Publication:746308)
Recommendations
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- An algorithm for fast optimal Latin hypercube design of experiments
- Orthogonal-maximin Latin hypercube designs
- A study on algorithms for optimization of Latin hypercubes
- Optimal Latin-hypercube designs for computer experiments
Cites work
- A study of particle swarm optimization particle trajectories
- A study on algorithms for optimization of Latin hypercubes
- Accelerating parallel particle swarm optimization via GPU
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- An algorithm for fast optimal Latin hypercube design of experiments
- An efficient algorithm for constructing optimal design of computer experiments
- Bounds for maximin Latin hypercube designs
- Centered \(L_2\)-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- Exploratory designs for computational experiments
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Maximin Latin Hypercube Designs in Two Dimensions
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal-maximin Latin hypercube designs
- Predicting the output from a complex computer code when fast approximations are available
- The design and analysis of computer experiments.
Cited in
(23)- Estimation of global minimum value of the optimality criteria for constructing optimal Latin hypercube designs
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- Discrete particle swarm optimization for constructing uniform design on irregular regions
- Bandits help simulated annealing to complete a maximin Latin hypercube design
- Space-filling experimental designs for constrained design spaces
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- Particle swarm optimization for searching efficient experimental designs: a review
- d-QPSO: A Quantum-Behaved Particle Swarm Technique for FindingD-Optimal Designs With Discrete and Continuous Factors and a Binary Response
- Construction of maximin \(L_1\)-distance Latin hypercube designs
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
- Column expanded Latin hypercube designs
- Optimizing two-level orthogonal arrays for simultaneously estimating main effects and pre-specified two-factor interactions
- Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- Robust optimization of composite cylindrical shell by a trigonometric mixed response surface method
- Efficient kriging using interleaved lattice-based designs with low fill and high separation distance properties
- Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
- A fast optimal Latin hypercube design method using an improved translational propagation algorithm
- Group symmetric Latin hypercube designs for symmetrical global sensitivity analysis
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
This page was built for publication: Optimizing Latin hypercube designs by particle swarm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746308)
