On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs
Pierre Berg\'e, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik

TL;DR
This paper introduces a new perturbation and evaluation function for simulated annealing to improve the construction of Maximin Latin Hypercube Designs, achieving superior results over existing methods.
Contribution
It proposes a novel 1D-move perturbation and a new evaluation function specifically for Maximin criteria, enhancing local search heuristics for Latin Hypercube Designs.
Findings
Surpassed best scores in literature for Latin Hypercube Designs
New evaluation function shows promise for various Maximin optimization problems
Enhanced exploration capabilities with 1D-move perturbation
Abstract
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 specifically targeting the Maximin criterion. Exhaustive series of experiments with Simulated Annealing, which we used as a typically well-behaving local search heuristics, confirm that our goal was reached as the result we obtained surpasses the best scores reported in the literature. Furthermore, the function seems very promising for a wide spectrum of optimization problems through the Maximin criterion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Advanced Multi-Objective Optimization Algorithms · Optimization and Packing Problems
