Answers are grounded in this paper and cite their sources.
The two-dimensional bin packing problem involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. In this paper, we propose and develop mathematically a new pretreatment for the oriented version of the problem in order to reduce its size, identify and value the lost spaces by increasing the size of some objects. A heuristic method based on the first-fit strategy adapted to this problem is proposed. We present an approach of resolution using the bee colony optimization. The computational results show the effectiveness of the pretreatment in reducing the number of bins.
No takes yet. Share an insight, caveat, or question.
Amara et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: