The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Article Dans Une Revue Operations Research Année : 2018

The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem

Résumé

In meta-modeling, the choice of sampling points is crucial for the quality of the model. In this context, the maximin Latin Hypercube Designs (LHD), with their space-filling and non-collapsing properties, are particularly efficient. To this day, there is no polynomial time algorithm that produces optimal maximin LHDs, i.e. in which the minimum distance between two points (the separation distance) is maximal. We are interested in LHDs with a separation distance as large as possible. The algorithm we propose, IES, gives an approximate solution to the LHD problem regardless of its dimension and size with a theoretical performance guarantee. We introduce two upper bounds for the separation distance to find its approximation ratio. Its performance is compared with the best metaheuristic algorithm known for this problem, an appropriate simulated annealing scheme. Our algorithm defeats the metaheuristic algorithm for large instances of the problem while having a very short running time.
Fichier non déposé

Dates et versions

hal-01702467 , version 1 (06-02-2018)

Identifiants

Citer

Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem. Operations Research, 2018, 66 (1), ⟨10.1287/opre.2017.1665⟩. ⟨hal-01702467⟩
123 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More