A best-fit heuristic algorithm for two-dimensional bin packing problem

摘要

Two-dimensional bin packing problem (2D-BPP) is to minimize the number of the used large rectangles (bins) for packing a set of small rectangles (items). In this paper, a best-fit algorithm (BF) based on the strategy of concave corner and best fitness value for this problem is proposed. Experimental results show that this heuristic algorithm could obtain better and reliable results for almost all test instances in less time than some classical algorithms.