The rectangular cutting and orthogonal packing problems which have many practical applications in industry and engineering are considered. Increasing the density of placement schemes leads to reducing the material usage in solving the rectangular cutting problems and reducing the unused resources at solving the orthogonal packing problems. This article contains the description of the developed packing compaction algorithm and its investigation. This algorithm uses six object selection rules, which select objects from a container for deleting and subsequent reallocation of them into freed spaces of the container. The packing compaction algorithm iteratively applies a one-pass heuristic algorithm which finds the best placement of the deleted objects in order to increase the density of the result packing. The effectiveness of the application of the proposed algorithm is investigated on the standard two-dimensional strip packing problems which are the rectangular cutting problems with only one container of a fixed width and an infinite length. Based on the test results, the effective sequence of application of the proposed rules used as the part of the packing algorithm was determined. The packing compaction algorithm is implemented in a general form which makes it possible for application in the rectangular cutting and orthogonal packing problems of arbitrary dimension.
Compaction algorithm Packing Packing problem Rectangular cutting Optimization
This is a preview of subscription content, log in to check access.
Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130CrossRefGoogle Scholar
Johnson DS (2012) A brief history of NP-completeness, 1954–2012. Doc Math Extra Volume ISMP 359–376Google Scholar
Chekanin VA, Chekanin AV (2014) Development of the multimethod genetic algorithm for the strip packing problem. Appl Mech Mater 598:377–381CrossRefGoogle Scholar
Goncalves JF, Resende MGC (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145(2):500–510CrossRefGoogle Scholar
Kierkosz I, Luczak M (2014) A hybrid evolutionary algorithm for the two-dimensional packing problem. Cent Eur J Oper Res 22(4):729–753MathSciNetCrossRefGoogle Scholar
Leung SCH, Zhang DF, Zhou CL, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(1):64–73CrossRefGoogle Scholar