Finding maximin latin hypercube designs by Iterated Local Search heuristics |
| |
Authors: | A Grosso ARMJU JamaliM Locatelli |
| |
Institution: | Corso Svizzera, 185, 10149 Torino, Italy |
| |
Abstract: | The maximin LHD problem calls for arranging N points in a k-dimensional grid so that no pair of points share a coordinate and the distance of the closest pair of points is as large as possible. In this paper we propose to tackle this problem by heuristic algorithms belonging to the Iterated Local Search (ILS) family and show through some computational experiments that the proposed algorithms compare very well with different heuristic approaches in the established literature. |
| |
Keywords: | Latin hypercube designs Maximin designs Iterated Local Search |
本文献已被 ScienceDirect 等数据库收录! |