An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
From MaRDI portal
Publication:2792910
DOI10.1080/00207721.2013.835003zbMath1332.93254OpenAlexW1987187314MaRDI QIDQ2792910
Sujin Bureerat, Nantiwat Pholdee
Publication date: 14 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2013.835003
simulated annealingdesign of experimentsequencing optimisationoptimum Latin hypercube samplingspace filling quality
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
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 ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
Cites Work
- Analysis of the single-vehicle cyclic inventory routing problem
- An application of a GA with Markov network surrogate to feature selection
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
- A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
This page was built for publication: An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
