arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.07225cs.AI
收藏

极大极小拉丁超立方设计的模拟退火算法

On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs

LRI, CentraleSupélec, Université Paris-Saclay(巴黎萨克雷大学中央理工高等电力学院LRI)

Pierre Bergé, Kaourintin Le Guiban, Arpad Rimmel, Joanna Tomasik

摘要:

我们的研究目标是提高用于构建拉丁超立方体设计的局部搜索算法。首先,我们引入了\textit{1D-move}扰动,以改善这些算法执行的空间探索。其次,我们提出了一个新的评价函数$ψ_{p,σ}$专门针对最大最小准则。我们使用模拟退火作为一种典型的表现良好的局部搜索算法进行了一系列详尽的实验,证实了我们的目标已经达到,因为我们获得的结果超过了文献中报道的最佳分数。此外,$ψ_{p,σ}$函数似乎非常有前途的最大最小准则的优化问题的广泛频谱。

英文摘要:

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 $ψ_{p,σ}$ 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 $ψ_{p,σ}$ function seems very promising for a wide spectrum of optimization problems through the Maximin criterion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑