A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube

@inproceedings{Rimmel2014ASO,
  title={A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube},
  author={Arpad Rimmel and Fabien Teytaud},
  booktitle={EvoCOP},
  year={2014}
}
Finding maximin latin hypercube is a discrete optimization problem believed to be NP-hard. In this paper, we compare different meta-heuristics used to tackle this problem: genetic algorithm, simulated annealing and iterated local search. We also measure the importance of the choice of the mutation operator and the evaluation function. All the experiments are done using a fixed number of evaluations to allow future comparisons. Simulated annealing is the algorithm that performed the best. By… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Generalized simulated annealing for function optimization

I. O. Bohachevsky, M. E. Johnson, M. L. Stein
Technometrics, 28(3):209–217, • 1986
View 5 Excerpts
Highly Influenced

Finding maximin latin hypercube designs by Iterated Local Search heuristics

European Journal of Operational Research • 2009
View 8 Excerpts
Highly Influenced

E

B. G. Husslage, G. Rennen
R. van Dam, and D. den Hertog. Space-filling latin hypercube designs for computer experiments. Optimization and Engineering, 12(4):611–630, • 2011
View 2 Excerpts

A study on algorithms for optimization of latin hypercubes

M. Liefvendahl, R. Stocki
Journal of Statistical Planning and Inference, 136(9):3231–3247, • 2006
View 1 Excerpt

An efficient algorithm for constructing optimal design of computer experiments

R. Jin, W. Chen, A. Sudjianto
Journal of Statistical Planning and Inference, 134(1):268–287, • 2005
View 3 Excerpts

Formulation of the optimal latin hypercube design of experiments using a permutation genetic algorithm

S. J. Bates, J. Sienz, V. V. Toropov
AIAA, 2011:1–7, • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…