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
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