Search space exploration and an optimization criterion for hard design problems - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Search space exploration and an optimization criterion for hard design problems

Pierre Bergé
Arpad Rimmel
Kaourintin Le Guiban
  • Fonction : Auteur
  • PersonId : 981555
Joanna Tomasik

Résumé

The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the \textit{1D-move} perturbation to improve the space exploration performed by these algorithms. Second, we propose a new evaluation function $\psi_{p,\sigma}$ specifically targeting the Maximin criterion. Series of experiments with Simulated Annealing confirm that our goal was reached as the result we obtained surpasses the best scores reported in the literature. Furthermore, the $\psi_{p,\sigma}$ function seems very promising for a wide spectrum of optimization problems with the Maximin criterion.
Fichier non déposé

Dates et versions

hal-01308582 , version 1 (28-04-2016)

Identifiants

  • HAL Id : hal-01308582 , version 1

Citer

Pierre Bergé, Arpad Rimmel, Kaourintin Le Guiban, Joanna Tomasik. Search space exploration and an optimization criterion for hard design problems. Genetic and Evolutionary Computation Conference (ACM GECCO), ACM, Jul 2016, Denver, United States. ⟨hal-01308582⟩
128 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More