.png){kind=icon}
.png){kind=icon}
Return
Algorithmic approaches to the multiple knapsack assignment problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.omega.2018.11.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a variant of the multiple knapsack problem in which some assignment-type side constraints have to be satisfied. The problem finds applications in logistics sectors related, e.g., to transportation and maritime shipping. We derive upper bounds from Lagrangian and surrogate relaxations of a mathematical model of the problem. We introduce a constructive heuristic and a metaheuristic refinement. We study the computational complexity of the proposed methods and evaluate their practical performance through extensive computational experiments on benchmarks from the literature and on new sets of randomly generated instances. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Multiple knapsack problem
Assignment problem
Relaxations
Heuristic algorithms
Computational experiments
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W