Browse > Article

An Improved Best-First Branch and Bound Algorithm for Unconstrained Two-Dimensional Cutting Problems  

Yoon Ki-Seop (한양대학교 산업공학과)
Bang Sung-Kyu (현대자동차)
Kang Maing-Kyu (한양대학교 산업공학과)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.30, no.4, 2005 , pp. 61-70 More about this Journal
Abstract
In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.
Keywords
Cutting Problem; Two-dimensional; Branch and Bound; Optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Gilmore, P.C. and R.E. Gomory, 'The Theory and Computation of Knapsack Functions,' Operations Research, Vol.14(1969), pp.1045-1074   DOI   ScienceOn
2 Cung, V.D., M. Hifi, and B.L. Cun, 'Constrained Two-dimensional Cutting Stock Problems a Best-first Branch-and-bound Algorithm,' International Transactions in Operational Research, Vol.7(2000), pp.185-210   DOI   ScienceOn
3 Gilmore, P.C. and R.E. Gomory, 'A Linear Programming approach to the Cutting-stock Problem,' Operations Research, Vol.9(1961), pp.849-859   DOI   ScienceOn
4 Hifi, M. and V. Zissimopoulos, 'A Recursive Exact Algorithm for Weighted Two-dimensional Cutting,' European Journal of Operational Research, Vol.91(1996), pp.553-564   DOI   ScienceOn
5 G, Y.G., Y.J. Seong, and M.K. Kang, 'A Best-first Branch and Bound Algorithm for Unconstrained Two-dimensional Cutting Problems,' Operations Research Letters, Vol.31(2003), pp.301-307   DOI   ScienceOn
6 Herz, J.C., 'A Recursive Computational Procedure for Two-dimensional Stock Cutting,' IBM Journal of Research and Development, Vol.16(1972), pp.462-469   DOI
7 Morabito, R.N., M.N. Arenales, and V.F. Arcaro, 'An And-or-graph Approach for Two-dimensional Cutting Problems,' European Journal of Operational Research, Vol.58(1992), pp.263-271   DOI   ScienceOn
8 Christofides, N. and C. Whitlock, 'An Algorithm for Two-dimensional Cutting Problems,' Operations Research, Vol.26(1977), pp.30-44
9 Wang, P.Y., 'Two Algorithms for Constrained Two-dimensional Cutting Stock Problems,' Operations Research, Vol.31 (1983), pp.573-586   DOI   ScienceOn
10 Beasley, J.E., 'Algorithms for Unconstrained Two-dimensional Guillotine Cutting,' Journal of the Operational Research Society, Vol.36(1985), pp.297-306   DOI   ScienceOn
11 Hifi, M., 'The DH/KD Algorithm: A Hybrid approach for Unconstrained Two-dimensional Cutting Problems,' European Journal of Operational Research, Vol.97(1997), pp. 41-52   DOI   ScienceOn