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

摘要：

Two-dimensional bin packing problem (2D-BPP) i* 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.

关键词： Best-Fit Heuristic algorithm two-dimensional bin packing problem

作者: Dayong Cao V. M. Kotov

作者单位: Department of Applied Mathematics Harbin University of Science and Technology, Harbin, China Depart Department of Applied Mathematics and Computer Science Belarusian State University, Minsk, Belarus

会议类型: 国际会议

会议名称: 2011 International Conference on Electronic & Mechanical Engineering and Information Technology(EMEIT 2011)(2011年机电工程与信息技术国际会议)

会议地点: 哈尔滨

会议语种:英文

页码: 3789-3791

在线出版日期: 2011-08-12（万方平台首次上网日期，不代表论文的发表时间）