Abstract
We investigate two cutting problems and their variants in which orthogonal rotations are allowed. We present a dynamic programming based algorithm for the Two-dimensional Guillotine Cutting Problem with Value (GCV) that uses the recurrence formula proposed by Beasley and the discretization points defined by Herz. We show that if the items are not so small compared to the dimension of the bin, this algorithm requires polynomial time. Using this algorithm we solved all instances of GCV found at the OR–LIBRARY, including one for which no optimal solution was known. We also investigate the Two-dimensional Guillotine Cutting Problem with Demands (GCD). We present a column generation based algorithm for GCD that uses the algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, I., Megiddo, N., Todd, M.J.: New results on the average behavior of simplex algorithms. Bull. Amer. Math. Soc (N.S.) 11(2), 378–382 (1984)
Arenales, M., Morábito, R.: An and/or-graph approach to the solution of twodimensional non-guillotine cutting problems. European Journal of Operations Research 84, 599–617 (1995)
Bansal, N., Srividenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 189–196. ACM, New York (2004)
Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36(4), 297–306 (1985)
Beasley, J.E.: An exact two-dimensional nonguillotine cutting tree search procedure. Oper. Res. 33(1), 49–64 (1985)
Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Borgwardt, K.-H.: Probabilistic analysis of the simplex method. In: Mathematical developments arising from linear programming, Brunswick, ME (1988). Contemp. Math., vol. 114, pp. 21–34. Amer. Math. Soc., Providence (1990)
Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings of the 43-rd Annual IEEE Symposium on Foundations of Computer Science, pp. 490–499. IEEE Computer Society, Los Alamitos (2002)
Christofides, N., Whitlock, C.: An algorithm for two dimensional cutting problems. Operations Research 25, 30–44 (1977)
Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3, 66–76 (1982)
Cintra, G.F.: Algoritmos híbridos para o problema de corte unidimensional. In: XXV Conferência Latinoamericana de Informática, Assunção (1999)
Cintra, G.F.: Algoritmos para problemas de corte de guilhotina bidimensional (PhD thesis in preparation). Instituto de Matemática e Estatística (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)
Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 179–188. ACM, New York (2004)
Csirik, J., Van Vliet, A.: An on-line algorithm for multidimensional bin packing. Operations Research Letters 13, 149–158 (1993)
Cung, V.-D., Hifi, M., Le Cun, B.: Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm. Int. Trans. Oper. Res. 7(3), 185–210 (2000)
Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)
Gilmore, P., Gomory, R.: Multistage cutting stock problems of two and more dimensions. Operations Research 13, 94–120 (1965)
Herz, J.C.: A recursive computational procedure for two-dimensional stock-cutting. IBM Journal of Research Development, 462–469 (1972)
Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645–656 (2000)
Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensional cube packing. In Brazilian Symposium on Graphs and Combinatorics. In: Electronic Notes of Discrete Mathematics (GRACO 2001), Elsevier Science, Amsterdam (2001) (to appear in Algorithmica)
Li, K., Cheng, K.-H.: Generalized first-fit algorithms in two and three dimensions. Internat. J. Found. Comput. Sci. 1(2), 131–150 (1990)
Miyazawa, F.K., Wakabayashi, Y.: Parametric on-line algorithms for packing rectangles and boxes. European J. Oper. Res. 150(2), 281–292 (2003)
Oliveira, J.F., Ferreira, J.S.: An improved version of Wang’s algorithm for twodimensional cutting problems. European Journal of Operations Research 44, 256–266 (1990)
Seiden, S., van Stee, R.: New bounds for multidimensional packing. Algorithmica 36, 261–293 (2003)
Wäscher, G., Gau, T.: Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18, 131–144 (1996)
Xpress. Xpress Optimizer Reference Manual. DASH Optimization, Inc. (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cintra, G., Wakabayashi, Y. (2004). Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive