A best-fit heuristic algorithm for two-dimensional bin packing problem
- Resource Type
- Conference
- Authors
- Cao, Dayong; Kotov, V. M.
- Source
- Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on. 7:3789-3791 Aug, 2011
- Subject
- Computing and Processing
Heuristic algorithms
Field-flow fractionation
Approximation algorithms
Educational institutions
Reliability
System-on-a-chip
Best-Fit
Heuristic algorithm
two-dimensional bin packing problem
- Language
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.