Abstract
In this paper we propose two algorithms for solving both unweighted and weighted constrained two-dimensional two-staged cutting stock problems. The problem is called two-staged cutting problem because each produced (sub)optimal cutting pattern is realized by using two cut-phases. In the first cut-phase, the current stock rectangle is slit down its width (resp. length) into a set of vertical (resp. horizontal) strips and, in the second cut-phase, each of these strips is taken individually and chopped across its length (resp. width).
First, we develop an approximate algorithm for the problem. The original problem is reduced to a series of single bounded knapsack problems and solved by applying a dynamic programming procedure. Second, we propose an exact algorithm tailored especially for the constrained two-staged cutting problem. The algorithm starts with an initial (feasible) lower bound computed by applying the proposed approximate algorithm. Then, by exploiting dynamic programming properties, we obtain good lower and upper bounds which lead to significant branching cuts. Extensive computational testing on problem instances from the literature shows the effectiveness of the proposed approximate and exact approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Albano and G. Sapuppo, “Optimal allocation of two-dimensional irregular shapes using heuristic search meth-ods,” IEEE, Trans. Sys. Man. Cyb., vol. 10, no 5, pp. 242–248, 1980.
M. Arenales and R. Morabito, “An overview of and-or-graph approach to cutting and packing problems,” ISBN 5–86911–161–7, 1997, pp. 207–224.
J.E. Beasley, “Algorithms for unconstrained two-dimensional guillotine cutting,” Journal of the Operational Research Society, vol. 36, pp. 297–306, 1985.
N. Christofides and E. Hadjiconstantinou, “An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts,” European Journal of Operational Research, vol. 83, pp. 21–38, 1995.
N. Christofides and C. Whitlock, “An algorithm for two-dimensional cutting problems,” Operations Research, vol. 2, pp. 31–44, 1977.
V-D. Cung, M. Hifi, and B. Le Cun, “Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm,” International Transactions in Operational Research, vol. 7, pp. 185–210, 2000.
H. Dyckhoff, “A typology of cutting and packing problems,” European Journal of Operational Research, vol. 44, pp. 145–159, 1990.
D. Fayard, M. Hifi, and V. Zissimopoulos, “An efficient approach for large-scale two-dimensional guillotine cutting stock problems,” Journal of the Operational Research Society, vol. 49, pp. 1270–1277, 1998.
P.C. Gilmore, “Cutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections,” Annals of Discrete Mathematics, vol. 4, pp. 217–235, 1979.
P.C. Gilmore and R.E. Gomory, “Multistage cutting problems of two and more dimensions,” Operations Research, vol. 13, pp. 94–119, 1965.
P.C. Gilmore and R.E. Gomory, “The theory and computation of knapsack functions,” Operations Research, vol. 14, pp. 1045–1074, 1966.
J.C. Herz, “A recursive computing procedure for two-dimensional stock cutting,” IBM Journal of Research and Development, vol. 16, pp. 462–469, 1972.
M. Hifi, “An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems,” Computers and Operations Research, vol. 24, pp.727–736, 1997.
M. Hifi, “Contribution à la résolution de quelques problèmes difficiles de l'optimisation combinatoire,” Habilitation Thesis. PRi SM, Université de Versailles St-Quentin en Yvelines, 1999.
M. Hifi, “Exact algorithms for large-scale unconstrained two and three staged cutting problems,” Computational Optimization and Applications, vol. 18, pp. 63–88, 2001.
M. Hifi and V. Zissimopoulos, “A recursive exact algorithm for weighted two-dimensional cutting problems,” European Journal of Operational Research, vol. 91, pp. 553–564, 1996.
M. Hifi and V. Zissimopoulos, “Constrained two-dimensional cutting: An improvement of Christofides and Whit-lock's exact algorithm,” Journal of the Operational Research Society, vol. 5, pp. 8–18, 1997.
E.L. Lawler, “Fast approximation algorithms for knapsack problems,” Mathematics of Operations Research, vol. 4, pp. 339–356, 1979.
S. Martello and P. Toth, “An exact algorithm for large unbounded knapsack problems,” Operations Research Letters, vol. 9, pp. 15–20, 1990.
S. Martello and P. Toth, “Upper bounds and algorithms for hard 0–1 knapsack problems,” Operations Research, vol. 45, pp. 768–778, 1997.
R. Morabito and M. Arenales, “Staged and constrained two-dimensional guillotine cutting problems: An and-or-graph approach,” European Journal of Operational Research, vol. 94, no. 3, pp. 548–560, 1996.
R. Morabito, M. Arenales, and V. Arcaro, “An and-or-graph approach for two-dimensional cutting problems,” European Journal of Operational Research, vol. 58, no. 2, pp. 263–271, 1992.
R. Morabito and V. Garcia, “The cutting stock problem in hardboard industry: A case study,” Computers and Operations Research, vol. 25, pp. 469–485, 1998.
D. Pisinger, “A minimal algorithm for the 0–1 knapsack problem,” Operations Research, vol. 45, pp. 758–767, 1997.
P.E. Sweeney and E.R. Paternoster, “Cutting and packing problems: A categorized applications-oriented research bibliography,” Journal of the Operational Research Society, vol. 43, pp. 691–706, 1992.
M. Syslo, N. Deo, and J. Kowalik, Discrete Optimization Algorithms, Prentice-Hall: New Jersey, 1983.
K.V. Viswanathan and A. Bagchi, “Best-first search methods for constrained two-dimensional cutting stock prob-lems,” Operations Research, vol. 41, no. 4, pp. 768–776, 1993.
P.Y. Wang, “Two algorithms for constrained two-dimensional cutting stock problems,” Operations Research, vol. 31, no. 3, pp. 573–586, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hifi, M., Roucairol, C. Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. Journal of Combinatorial Optimization 5, 465–494 (2001). https://doi.org/10.1023/A:1011628809603
Issue Date:
DOI: https://doi.org/10.1023/A:1011628809603