Kernel based tabu search for the Set-union Knapsack Problem

作者：

Highlights：

• The Set-Union Knapsack problem is a relevant model for many expert and intelligent systems.

• We design a new algorithm for solving the problem based on the notion of kernel.

• We present extensive computational experiments on 60 benchmark instances.

• We show the competitiveness of the proposed algorithm compared to the state-of-the-art.

• We make the code of our algorithm publicly available.

摘要

•The Set-Union Knapsack problem is a relevant model for many expert and intelligent systems.•We design a new algorithm for solving the problem based on the notion of kernel.•We present extensive computational experiments on 60 benchmark instances.•We show the competitiveness of the proposed algorithm compared to the state-of-the-art.•We make the code of our algorithm publicly available.

论文关键词：Knapsack,Heuristics and metaheuristics,Decision making,Intelligent systems,Combinatorial optimization

论文评审过程：Received 17 February 2020, Revised 28 July 2020, Accepted 29 July 2020, Available online 1 August 2020, Version of Record 13 August 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113802