Solving 2D Rectangle Packing Problem Based on Layer Heuristic and Genetic Algorithm

摘要：

The packing of rectangles is a NP-Complete problem and possesses widespread applications in the industry, such as the cutting of clothing, metal and composition of news. In this paper, an orthogonal rectangle packing problem with rotation of items and without the guillotine packing constraint is considered. A layer-based heuristic algorithm is presented with the combination of genetic algorithm. This heuristic algorithm is mainly based on heuristic strategies inspired by the wall-building rule of bricklayers in daily life. The computational results on Benchmark problems have shown that this algorithm not only runs in shorter time than known metaheuristic but also finds shorter height.

关键词： packing problem heuristic algorithm Genetic Algorithm

作者: Qiaowei Li Shuangyuan Yang Senxing Zhu

作者单位: Software School of Xiamen University, Xiamen, China

会议类型: 国际会议

会议名称: 2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics 第4届智能人机系统与控制论国际会议 IHMSC 2012

会议地点: 南昌

会议语种:英文

页码: 552-555

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