%0 Journal Article
%T Lowest-Level Left Align Best-Fit Algorithm for the 2D Rectangular Strip Packing Problem<br>二维矩形条带装箱问题的底部左齐择优匹配算法
%A 蒋兴波
%A 吕肖庆
%A 刘成城
%J 软件学报
%D 2009
%I 
%X 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) and the bottom-left-fill (BLF) heuristic placement algorithms, LLABF algorithm dynamically selects the best-fit rectangle for packing. The computation result shows that 2DR-SPP can be solved more effectively by combining the LLABF algorithm with the genetic algorithm (GA).
%K lowest-level left align best fit (LLABF) algorithm
%K genetic algorithm
%K 2D rectangular strip packing problem
%K heuristic placement algorithm<br>最低左对齐最佳匹配(LLABF)算法
%K 遗传算法
%K 二维矩形条带装箱问题
%K 启发式布局算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=46DD291AF09FB80DC4077E740409787D&yid=DE12191FBD62783C&vid=A04140E723CB732E&iid=B31275AF3241DB2D&sid=6A46E5A5880213FE&eid=5AF7AC8009D8B9DB&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=22