New solutions to the constrained compartmentalised knapsack problem

Robinson S.V. Hoto and Glaucia Maria Bressan

International Journal of Operational Research, 2017, vol. 28, issue 4, 472-487

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.

Keywords: combinatorial optimisation; compartmentalised knapsack problem; heuristics; cutting stock problems. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=82609 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:28:y:2017:i:4:p:472-487

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().