.png){kind=icon}
返回
Matheuristics for solving the Multiple Knapsack Problem with Setup
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2019.01.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The knapsack problem is one of the most investigated and applicable combinatorial optimization problems. In this paper we consider a generalized problem called the Multiple Knapsack Problem with Setup (MKPS) in which a set of families of items and a set of knapsacks are available. Each item is characterized by a knapsack-dependent profit and each family is associated with a knapsack-dependent cost. We formally present a mixed-integer linear program of the MKPS and we propose a multi-level matheuristic to solve large size instances of the problem. The matheuristic takes advantage of the structure of the problem and the decomposition principle. Furthermore, we enhance our solution approach combining it with tabu search. We carry out a computational study to assess the performance of the proposed matheuristics on a set of instances from the Knapsack Problem with Setup (KPS) literature. The computational results show that the proposed matheuristic is competitive compared with the state-of-the-art methods. To better evaluate its performance, we generate a new testbed for the MKPS and we compare the results to exact solutions provided by a commercial solver. Computational experiments substantiate the good performance of the proposed methods as they provide new best known values for 185 instances out of 360 in a very competitive running time.
Keyword:
Multiple Knapsack Problem with Setup
Matheuristic
Tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏
查看更多内容