Heuristics for determining the number of warehouses for storing non-compatible products

In this paper we discuss a version of the classical knapsack problem, where the objective is to minimize the number of warehouses needed to store given items, each with some space requirements. In this version, some of the items are incompatible with each other, and cannot be stored together. We apply some newly developed heuristics to this problem and compare the results with other available algorithms. The computational results are presented and indicate that higher quality solutions can be obtained using the new heuristics.