A dynamic ordering rule based on size matches for the rectangular packing problems
The packing problem is derived from practices that occur in industrial production and in real life, and the solution could rely on experience from these environments. In real life, people often place a pair of items or a set of pieces with the same size together. This action makes the remaining packing region simple and regular and benefits later layouts. Based on experience, we have designed a dynamic ordering rule that is based on size matching; the algorithm is presented in this paper. The ordering rule selects a rectangular piece by the match level of the rectangular piece and the sizes of the remaining packing region. Throughout a series of experiments, we prove that the ordering rule can obtain better packing results compared to previous approaches.
packing problem attractive factor approach size matching dynamic ordering rule
Jinmin Wang Yang Qi Yiping Lu
Tianjin Key Laboratory of High Speed Cutting & Precision Machining, TUTE, Tianjin, China School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, Chin
国际会议
南昌
英文
556-559
2012-08-26（万方平台首次上网日期，不代表论文的发表时间）