Adaptive iterated local search for cross-domain optimisation

Adaptive iterated local search for cross-domain optimisation
复制标题

用于跨域优化的自适应迭代局部搜索

DOI:
10.1145/2001576.2001843
复制
发表时间:
2011
期刊:
--
影响因子:
--
通讯作者:
Burke E
Burke E
中科院分区:
--
文献类型:
--
作者:
Burke E

文献摘要

参考文献

被引文献

相似文献

我们提出了多邻域迭代局部搜索算法的两种自适应变体。这些变体采用在线学习技术,也称为自适应操作选择,以便从一组可用的移动算子中选择在每个迭代步骤应用哪个扰动。使用通用软件接口(HyFlex框架),所提出的算法在四个硬组合优化问题上进行了测试:排列流水车间、一维装箱、最大可满足性和人员调度(包括来自实际工业应用的实例数据)。使用 HyFlex 框架,可以将完全相同的高级搜索策略应用于所有域和实例。我们的结果证实,自适应变体优于具有统一随机选择移动算子的基线迭代局部搜索。我们认为所提出的自适应算法是通用而强大的,并且有助于提高启发式搜索的通用性和适用性的目标。
We propose two adaptive variants of a multiple neighborhood iterated local search algorithm. These variants employ online learning techniques, also called adaptive operation selection, in order to select which perturbation to apply at each iteration step from a set of available move operators. Using a common software interface (theHyFlexframework), the proposed algorithms are tested across four hard combinatorial optimisation problems: permutation flow shop, 1D bin packing, maximum satisfiability, and personnel scheduling (including instance data from real-world industrial applications). Using the HyFlex framework, exactly the same high level search strategy can be applied to all the domains and instances. Our results confirm that the adaptive variants outperform a baseline iterated local search with uniform random selection of the move operators. We argue that the adaptive algorithms proposed are general yet powerful, and contribute to the goal of increasing the generality and applicability of heuristic search.
迭代局部搜索的自适应算子选择
DOI: --
发表时间: 2009
期刊: Engineering Stochastic Local Search Algorithms
影响因子: --
作者:
D. Thierens
通讯作者: D. Thierens