Title: New solutions to the constrained compartmentalised knapsack problem

Authors: Robinson S.V. Hoto; Glaucia Maria Bressan

Addresses: Department of Mathematics, State University of Londrina (UEL), Rodovia Celso Garcia Cid, Km 380 – Campus Universitário 86057-970, Londrina, PR, Brazil ' Department of Mathematics, Federal University of Technology of Paraná (UTFPR), 1640 Alberto Carazzai Av. 86000-000, Cornélio Procópio, PR, Brazil

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.

DOI: 10.1504/IJOR.2017.082609

International Journal of Operational Research, 2017 Vol.28 No.4, pp.472 - 487

Received: 09 Dec 2013
Accepted: 02 Aug 2014
Published online: 03 Mar 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article