二维矩形条带装箱问题的底部左齐择优匹配算法-软件学报.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.20, No.6, June 2009, pp .1528− 1538 http://www.j doi: 10.3724/SP.J.1001.2009.03395 Tel/Fax : +86-10 © by Institute of Software, the Chinese A cademy of Sciences . All rights reserved. ∗ 二维矩形条带装箱问题的底部左齐择优匹配算法 1,2 1,3+ 1 蒋兴波 , 吕肖庆 , 刘成城 1(北京大学 计算机科学技术研究所,北京 100871) 2 (第二军医大学 卫生勤务学系,上海 200433) 3(北京大学 电子出版新技术国家工程研究中心,北京 100871) Lowest-Level Left Align Best-Fit Algorithm for the 2D Rectangular Strip Packing Problem JIANG Xing-Bo 1,2, LÜ Xiao-Qing1,3+, LIU Cheng-Cheng1 1(Institute of Computer Science and Technology, Peking University, Beijing 100871, China) 2 (Faculty of Health Services, Second Military Medical University, Shanghai 200433, China) 3(National Engineering Research Center of New Technology in Electronic Publishing, Peking University, Beijing 100871, China) + Corresponding author: E-mail: lvxiaoqing@ Jiang XB, Lü XQ, Liu CC. Lowest-Level left align best-fit algorithm for the 2D rectangular strip packing problem. Journal of Software, 2009,20(6):1528−1538. /1000-9825/3395.htm Abstract: In this paper, a heuristic placement algorithm for the two-dimensional rectangular strip packing problem, lowest-level left align best fit (LLABF) algorithm, is presented. The LLABF algorithm is based on the best-fit priority principle with overall consideration of several heuristic rules, such as full-fit first rule, width-fit first rule, height-fit first rule, joint-width-fit first rule and placeable first rule. Unlike the bottom-left (BL), the improved-bottom-left (IBL