DocumentCode
3369284
Title
A best-fit heuristic algorithm for two-dimensional bin packing problem
Author
Dayong Cao ; Kotov, V.M.
Author_Institution
Dept. of Appl. Math., Harbin Univ. of Sci. & Technol., Harbin, China
Volume
7
fYear
2011
fDate
12-14 Aug. 2011
Firstpage
3789
Lastpage
3791
Abstract
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.
Keywords
bin packing; best fitness value strategy; best-fit heuristic algorithm; concave corner strategy; two-dimensional bin packing problem; Approximation algorithms; Educational institutions; Field-flow fractionation; Heuristic algorithms; Reliability; System-on-a-chip; Best-Fit; Heuristic algorithm; two-dimensional bin packing problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on
Conference_Location
Harbin, Heilongjiang
Print_ISBN
978-1-61284-087-1
Type
conf
DOI
10.1109/EMEIT.2011.6023883
Filename
6023883
Link To Document