Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 196-199.DOI: 10.3778/j.issn.1002-8331.2009.27.060

• 工程与应用 • Previous Articles     Next Articles

Hybrid algorithm for solving Single-Container Rectangular Packing Problem

JIANG Xing-bo,LIU Xiao-rong   

  1. Department of Health Service,Second Military Medical University,Shanghai 200433,China
  • Received:2008-11-05 Revised:2009-02-16 Online:2009-09-21 Published:2009-09-21
  • Contact: JIANG Xing-bo

求解单容器矩形装箱问题的混合算法

蒋兴波,刘晓荣   

  1. 第二军医大学 卫生勤务学教研室,上海 200433
  • 通讯作者: 蒋兴波

Abstract: The Single-Container Rectangular Packing Problem(SCRPP) is a typical combinatorial optimization problem and possesses widespread application in the industry.Firstly,a new heuristic algorithm,Lowest-Horizontal-Line Best Fit(LHLBF) algorithm,is proposed.The LHLBF algorithm can dynamically select the better-fit rectangle for packing according to five rules.Secondly,the hybrid algorithm can be obtained by combining LHLBF algorithm with the Genetic Algorithm(GA) for solving the SCRPP.The computational results show that GA+LHLBF algorithm is more effective than existing algorithms from the literature.

Key words: Single-Container Rectangular Packing Problem(SCRPP), Lowest-Horizontal-Line Best Fit(LHLBF) algorithm, Genetic Algorithm(GA), hybrid algorithm

摘要: 单容器矩形装箱问题是一个典型的组合优化问题,其在工业界有着广泛的应用。首先提出了一种新的启发式布局算法,即底部匹配算法,该算法在矩形的装入过程中根据五种启发式规则自动选择与装填区域相匹配的下一个矩形。然后将底部匹配算法与遗传算法相结合形成混合算法来求解单容器矩形装箱问题。实验结果表明,与已有算法相比,该文提出的算法更加有效。

关键词: 单容器矩形装箱问题, 底部匹配算法, 遗传算法, 混合算法

CLC Number: