New solutions to the constrained compartmentalised knapsack problem

New solutions to the constrained compartmentalised knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor2017919
Volume: 28
Issue: 4
Start Page Number: 472
End Page Number: 487
Publication Date: Mar 2017
Journal: International Journal of Operational Research
Authors: ,
Keywords: heuristics, cutting stock
Abstract:

The compartmentalised knapsack problem has been described in the literature as generating patterns of cutting problems in two phases. An exact algorithm, which involves the solution of several knapsacks, and another one, based on upper bounds, have already been developed. In the constrained case of a compartmentalised knapsack, in which bounds in the number of compartments and items are required, few results are known. In this paper, we present a new heuristic to solve the constrained case of the compartmentalised knapsack problem and make comparisons with the best heuristic registered in the literature.

Reviews

Required fields are marked *. Your email address will not be published.