Advertisement

A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts

  • Oliviana Xavier do NascimentoEmail author
  • Thiago Alves de Queiroz
  • Leonardo Junqueira
S.I. : CLAIO 2018
  • 33 Downloads

Abstract

This work presents guillotine constraints for two- and three-dimensional cutting problems. These problems look for a subset of rectangular items of maximum value that can be cut from a single rectangular container. Guillotine constraints seek to ensure that items are arranged in such a way that cuts from one edge of the container to the opposite edge completely separate them. In particular, we consider the possibility of 2, 3, and 4 cutting stages in a predefined sequence. These constraints are considered within a two-level iterative approach that combines the resolution of integer linear programming and constraint programming models. Experiments with instances of the literature are carried out, and the results show that the proposed approach can solve in less than 500 s approximately 60% and 50% of the instances for the two- and three-dimensional cases, respectively. For the two-dimensional case, in comparison with the recent literature, it was possible to improve the upper bound for 16% of the instances.

Keywords

Two- and three-dimensional cutting problems Guillotine cutting stage constraints Integer linear programming Constraint programming 

Notes

Acknowledgements

The authors would like to thank the Coordination for the Improvement of Higher Education Personnel (CAPES), the National Counsel of Technological and Scientific Development (CNPq - Grant 308312/2016-3), the State of Goiás Research Foundation (FAPEG), and the State of São Paulo Research Foundation (FAPESP).

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

References

  1. Amossen, R. R., & Pisinger, D. (2010). Multi-dimensional bin packing problems with guillotine constraints. Computers & Operations Research, 37(11), 1999–2006.Google Scholar
  2. Baldacci, R., & Boschetti, M. A. (2007). A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. European Journal of Operational Research, 183(3), 1136–1149.Google Scholar
  3. Beasley, J. E. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069–1072.Google Scholar
  4. Bortfeldt, A., & Jungmann, S. (2012). A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Annals of Operations Research, 196(1), 53–71.Google Scholar
  5. Caprara, A., & Monaci, M. (2004). On the two-dimensional knapsack problem. Operations Research Letters, 32(1), 5–14.Google Scholar
  6. Chien, C. F., & Wu, W. T. (1998). A recursive computational procedure for container loading. Computers & Industrial Engineering, 35(1–2), 319–322.Google Scholar
  7. Cintra, G., Miyazawa, F., Wakabayashi, Y., & Xavier, E. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191(1), 61–85.Google Scholar
  8. Dolatabadi, M., Lodi, A., & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers & Operations Research, 39(1), 48–53.Google Scholar
  9. Egeblad, J., & Pisinger, D. (2009). Heuristic approaches for the two-and three-dimensional knapsack packing problem. Computers & Operations Research, 36(4), 1026–1049.Google Scholar
  10. Fanslau, T., & Bortfeldt, A. (2010). A tree search algorithm for solving the container loading problem. INFORMS Journal on Computing, 22(2), 222–235.Google Scholar
  11. Fekete, S. P., Schepers, J., & Van der Veen, J. C. (2007). An exact algorithm for higher-dimensional orthogonal packing. Operations Research, 55(3), 569–587.Google Scholar
  12. Furini, F., Malaguti, E., & Thomopulos, D. (2016). Modeling two-dimensional guillotine cutting problems via integer programming. INFORMS Journal on Computing, 28(4), 736–751.Google Scholar
  13. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.Google Scholar
  14. Gilmore, P., & Gomory, R. E. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research, 13(1), 94–120.Google Scholar
  15. Gonzalez, Y., Miranda, G., & Leon, C. (2016). Multi-objective multi-level filling evolutionary algorithm for the 3d cutting stock problem. Procedia Computer Science, 96, 355–364.Google Scholar
  16. Hifi, M. (2002). Approximate algorithms for the container loading problem. International Transactions in Operational Research, 9(6), 747–774.Google Scholar
  17. Hifi, M. (2004). Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research, 31(5), 657–674.Google Scholar
  18. Junqueira, L., Morabito, R., & Yamashita, D. S. (2012). Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 39(1), 74–85.Google Scholar
  19. Lodi, A., Monaci, M., & Pietrobuoni, E. (2017). Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints. Discrete Applied Mathematics, 217, 40–47.Google Scholar
  20. Morabito, R., & Arenales, M. (1994). An and/or-graph approach to the container loading problem. International Transactions in Operational Research, 1(1), 59–73.Google Scholar
  21. Morabito, R., & Pureza, V. (2010). A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem. Annals of Operations Research, 179(1), 297–315.Google Scholar
  22. Pisinger, D., & Sigurd, M. (2007). Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing, 19(1), 36–51.Google Scholar
  23. Puchinger, J., & Raidl, G. R. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304–1327.Google Scholar
  24. Queiroz, T Ad, Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3d guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2), 200–212.Google Scholar
  25. Scheithauer, G. (2017). Introduction to cutting and packing optimization: Problems, modeling approaches, solution methods (Vol. 263). Berlin: Springer.Google Scholar
  26. Scheithauer, G., & Terno, J. (1996). The g4-heuristic for the pallet loading problem. Journal of the Operational Research Society, 47(4), 511–522.Google Scholar
  27. Toscano, A., Rangel, S., & Yanasse, H. H. (2017). A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. Annals of Operations Research, 258(2), 719–746.Google Scholar
  28. Velasco, A. S., & Uchoa, E. (2019). Improved state space relaxation for constrained two-dimensional guillotine cutting problems. European Journal of Operational Research, 272(1), 106–120.Google Scholar
  29. Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Institute of Mathematics and TechnologyFederal University of GoiásCatalãoBrazil
  2. 2.Department of Production Engineering, Polytechnic SchoolUniversity of São PauloSão PauloBrazil

Personalised recommendations