Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops
Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops
复制标题
最小化排列流水车间完工时间的启发式自动设计
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
M. Ritt
中科院分区：
文献类型：
--
作者：
Artur Brum;M. Ritt
启发式搜索方法的自动设计已成功地应用于许多优化问题。本文研究了算法自动配置在最小化完工时间的置换流水车间调度问题中的应用。我们的方法包括在使用一个语法来确定如何将联合收割机个别算法组件到一个迭代的本地搜索，再加上这样的语法的实例化的参数表示。为了探索算法搜索空间，我们采用了基于赛车的程序。所获得的算法进行了评估，两个著名的基准和比较，以国家的最先进的antiquistics。
The automatic design of heuristic search methods has been applied successfully to many optimization problems. In this paper we study the application of automatic algorithm configuration to the permutation flow shop scheduling problem with makespan minimization. Our approach consists in using a grammar to determine how to combine individual algorithmic components into an iterated local search, coupled with a parametric representation for the instantiations of such a grammar. To explore the algorithmic search space we employ a procedure based on racing. The obtained algorithms are evaluated on two well-known benchmarks and compared to state-of-the-art heuristics.