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.
Bulletin of Mathematical Sciences and Applications (Volume 14)
A. K. Amara and B. Djebbar, "New Pretreatment and Resolution Using the Bee Colony Optimization for the Two-Dimensional Bin Packing Problem", Bulletin of Mathematical Sciences and Applications, Vol. 14, pp. 13-22, 2016