.png){kind=icon}
返回
Hyper-heuristic local search for combinatorial optimisation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2020.106264.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Local search algorithms have been successfully used for many combinatorial optimisation problems. The choice of the most suitable local search algorithm is, however, a challenging task as their performance is highly dependent on the problem characteristic. In addition, most of these algorithms require users to select appropriate internal neighbourhood structures to obtain desirable performance. No single local search algorithm can consistently perform well with a fixed setting, for different types of problems or even different instances of the same problem. To address this issue, we propose a hyper-heuristic framework which incorporates multiple local search algorithms and a pool of neighbourhood structures. This framework is novel in three respects. Firstly, a two-stage hyper-heuristic structure is designed to control the selection of a local search algorithm and its internal operators. Secondly, we propose an adaptive ranking mechanism to choose the most appropriate neighbourhood structures for the current local search algorithm. The proposed mechanism uses the entropy to evaluates the contribution of the local search in terms of quality and diversity. It adaptively adjusts the pool of candidate neighbourhood structures. Thirdly, we use a population of solutions within the proposed framework to effectively navigate different areas in the solutions search space and share solutions with local search algorithms. To ensure different solutions is allocated in different regions of the search space, we propose a distance-based strategy for population updating process that allowing solutions to share local search algorithms. We have evaluated the performance of the proposed framework using two challenging optimisation problems: Multi-Capacity Bin Packing benchmark instances and Google Machine Reassignment benchmark instances. The results show the effectiveness of the proposed framework, which outperformed state-of-the-art algorithms on several problem instances. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Hyper-heuristic
Local search algorithm
Google machine reassignment
Multi-capacity bin packing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
5.1W
机构
引用论文
.png){kind=icon}
Analysis of selection hyper-heuristics for population-based meta-heuristics in real-valued dynamic optimization实值动态优化中基于种群的元启发式的选择超启发式分析
PREAI
分享收藏Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem混合粒子群优化算法移植到超启发式结构中，用于解决考试时间表问题
PREAI
分享收藏
查看更多内容