Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem

  • Ji, Jun (School of Mechanical, Electronic Engineering, Beijing Polytechnic) ;
  • Huang, Dun-hua (School of Mechanical, Electronic Engineering, Beijing Polytechnic) ;
  • Xing, Fei-fei (School of Mechanical, Electronic Engineering, Beijing Polytechnic) ;
  • Cui, Yao-dong (School of Computer, Electronics and Information, Guangxi University)
  • Received : 2020.04.10
  • Accepted : 2020.11.08
  • Published : 2021.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.

Keywords

Acknowledgement

This research was supported by the National Natural Science Foundation of China (No. 71371058, 61363026), Education Commission Scientific Foundation of Beijing (No. KM201910858004) and Natural Science Foundation of Beijing Polytechnic (No. 2019Z002-003-KXB).

References

  1. C. H. Cheng, B. R. Feiring, and T. C. E. Cheng, "The cutting stock problem-a survey," International Journal of Production Economics, vol. 36, no. 3, pp. 291-305, 1994. https://doi.org/10.1016/0925-5273(94)00045-X
  2. P. E. Sweeney and E. R. Paternoster, "Cutting and packing problems: a categorized, application-orientated research bibliography," Journal of the Operational Research Society, vol. 43, no. 7, pp. 691-706, 1992. https://doi.org/10.2307/2583579
  3. R. Alvarez-Valdes, F. Parreno, and J. M. Tamarit, "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, vol. 183, no. 3, pp. 1167-1182, 2007. https://doi.org/10.1016/j.ejor.2005.11.068
  4. R. Baldacci and M. A. Boschetti, "A cutting-plane approach for the two-dimensional orthogonal nonguillotine cutting problem," European Journal of Operational Research, vol. 183, no. 3, pp. 1136-1149, 2007. https://doi.org/10.1016/j.ejor.2005.11.060
  5. P. C. Gilmore and R. E. Gomory, "Multistage cutting stock problems of two and more dimensions," Operations Research, vol. 13, no. 1, pp. 94-120, 1965. https://doi.org/10.1287/opre.13.1.94
  6. J. Ji, Y. P. Lu, J. Z. Cha, J. Q. Yu, and Y. D. Cui, "An exact algorithm for large-scale unconstrained three staged cutting problems with same-size block requirement," International Journal of Information and Management Sciences, vol. 23, no. 1, pp. 59-78, 2012.
  7. M. Hifi, "Exact algorithms for large-scale unconstrained two and three staged cutting problems," Computational Optimization and Applications, vol. 18, no. 1, pp. 63-88, 2001. https://doi.org/10.1023/a:1008743711658
  8. Y. Cui, "Generating optimal T-shape cutting patterns for rectangular blanks," Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, vol. 218, no. 8, pp. 857-866, 2001 https://doi.org/10.1243/0954405041486037
  9. Y. Cui, D. He, and X. Song, "Generating optimal two-section cutting patterns for rectangular blanks," Computers & Operations Research, vol. 33, no. 6, pp. 1505-1520, 2006. https://doi.org/10.1016/j.cor.2004.09.022
  10. P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting stock problem-Part II," Operations Research, vol. 11, no. 6, pp. 863-888, 1963. https://doi.org/10.1287/opre.11.6.863
  11. J. E. Beasley, "Algorithms for unconstrained two-dimensional guillotine cutting," Journal of the Operational Research Society, vol. 36, no. 4, pp. 297-306, 1985. https://doi.org/10.1057/jors.1985.51
  12. J. C. Herz, "Recursive computational procedure for two-dimensional stock cutting," IBM Journal of Research and Development, vol. 16, no. 5, pp. 462-469, 1972. https://doi.org/10.1147/rd.165.0462
  13. M. Hifi and V. Zissimopoulos, "A recursive exact algorithm for weighted two-dimensional cutting," European Journal of Operational Research, vol. 91, no. 3, pp. 553-564, 1996. https://doi.org/10.1016/0377-2217(95)00343-6
  14. G. Young-Gun, 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, no. 4, pp. 301-307, 2003. https://doi.org/10.1016/S0167-6377(03)00002-6
  15. J. V. De Carvalho, "LP models for bin packing and cutting stock problems," European Journal of Operational Research, vol. 141, no. 2, pp. 253-273, 2002. https://doi.org/10.1016/S0377-2217(02)00124-8