论文信息 - Heuristics for the Rectangle Packing Problem

Heuristics for the Rectangle Packing Problem

In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are of practical interest. AMS Classification: 90C 10, 90C 05, 90B06

Guntram Scheithauer | Uta Sommerweiß

[1] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .

[2] Paul E. Sweeney,et al. Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[3] Guntram Scheithauer,et al. A Heuristic Approach for Solving the Multi-Pallet Packing Problem , 1996 .

[4] E. E. Bischoff,et al. Issues in the development of approaches to container loading , 1995 .

[5] Josef Nelißen,et al. Neue Ansätze zur Lösung des Palettenbeladungsproblems , 1995, Berichte aus der Informatik.

[6] Guntram Scheithauer,et al. The G4-Heuristic for the Pallet Loading Problem , 1996 .

[7] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .

[8] W. B. Dowsland,et al. Practical Considerations of the Pallet-Loading Problem , 1985 .

[9] Kathryn A. Dowsland,et al. The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems , 1984 .

[10] Thom J. Hodgson,et al. A Combined Approach to the Pallet Loading Problem , 1982 .

[11] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .