A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube - CentraleSupélec Access content directly
Conference Papers Year : 2014

A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube

Arpad Rimmel

Abstract

Finding maximin latin hypercube is a discrete optimization problem considered 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 using it, we obtained new highscores for a very large number of latin hypercubes.
No file

Dates and versions

hal-00926729 , version 1 (10-01-2014)

Identifiers

  • HAL Id : hal-00926729 , version 1

Cite

Arpad Rimmel, Fabien Teytaud. A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube. EvoCOP 2014, Apr 2014, Grenade, Spain. 12 p. ⟨hal-00926729⟩
103 View
0 Download

Share

Gmail Facebook X LinkedIn More