.png){kind=icon}
返回
Probability learning based tabu search for the budgeted maximum coverage problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2021.115310.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Budgeted Maximum Coverage Problem (BMCP) is a general model with a number of real-world applications. Given n elements with nonnegative profits, m subsets of elements with nonnegative weights and a total budget, the BMCP aims to select some subsets such that the total weight of the selected subsets does not exceed the budget, while the total profit of the associated elements is maximized. BMCP is NP-hard and thus computationally challenging. We investigate for the first time an effective practical algorithm for solving this problem, which combines reinforcement learning and local search. The algorithm iterates through two distinct phases, namely a tabu search phase and a probability learning based perturbation phase. To assess the effectiveness of the proposed algorithm, we show computational results on a set of 30 benchmark instances introduced in this paper and present comparative studies with respect to the approximation algorithm, the genetic algorithm and the CPLEX solver.
Keyword:
Budgeted maximum coverage problem
Learning-based optimization
Tabu search
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
.png){kind=icon}
PREAI
分享收藏A hybrid breakout local search and reinforcement learning approach to the vertex separator problem顶点分隔符问题的混合突破局部搜索和强化学习方法OAAI
OAAI分享收藏分享收藏Hydrogenation of Five-Membered Heteroaromatic Compounds Catalyzed by a Rhodium-Phosphine Complex
PREAI
分享收藏Six-month follow-up of effects of an information programme for patients with malignant melanoma
PREAI
分享收藏分享收藏
查看更多内容