An EDA for the 2D knapsack problem with guillotine constraint

  • István BorgulyaEmail author
Original Paper


In this paper we present an evolutionary heuristic for the 2D knapsack problem with guillotine constraint. In this problem we have a set of rectangles and there is a profit for each rectangle. The goal is to cut a subset of rectangles without overlap from a rectangular strip of width W and height H, so that the total profit of the rectangles from the subset is maximal. The sides of the rectangles are parallel to the strip sides and every cutting is restricted by orthogonal guillotine-cuts. A guillotine-cut is parallel to the horizontal or vertical side of the strip and cuts the strip into two separated rectangular strips. Our algorithm is an estimation of distribution algorithm (EDA), where recombination and mutation evolutionary operators are replaced by probability estimation and sampling techniques. Our EDA works with two probability models. It improves the quality of the solutions with local search procedures. The algorithm was tested on well-known benchmark instances from the literature.


Cutting-packing Knapsack Guillotine-cut EDA 


  1. Alvarez-Valdes R, Parajón A, Tamarit JM (2002) A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput Oper Res 29:925–947CrossRefGoogle Scholar
  2. Alvarez-Valdes R, Parreño F, Tamarit JM (2005) A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56:414–425CrossRefGoogle Scholar
  3. Arenales M, Morabito R (1995) An AND/OR-graph approach to the solution of two dimensional non-guillotine cutting problems. Eur J Oper Res 84:599–617CrossRefGoogle Scholar
  4. Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
  5. Baluja S, Davies S (1997) Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space. In: Proceedings of the international conference on machine learning, pp 30–38Google Scholar
  6. Beasley JE (1985a) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297–306CrossRefGoogle Scholar
  7. Beasley JE (1985b) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49–64CrossRefGoogle Scholar
  8. Beasley JE (2004) A population heuristic for constrained two-dimensional non-guillotine cutting. Eur J Oper Res 156:601–627CrossRefGoogle Scholar
  9. Borgulya I (2006) An evolutionary algorithm for the biobjective QAP. In: Reusch B (ed) Computational intelligence, theory and applications, advances in soft computing. Springer, Berlin, pp 577–586CrossRefGoogle Scholar
  10. Borgulya I (2014) A parallel hyper-heuristic approach for the two-dimensional rectangular strip-packing problem. J Comput Inf Technol 22(4):251–266CrossRefGoogle Scholar
  11. Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172:814–837CrossRefGoogle Scholar
  12. Bortfeldt A, Jungmann S (2012) A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Ann Oper Res 196:53–71CrossRefGoogle Scholar
  13. Bortfeldt A, Winter T (2009) A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. Int Trans Oper Res 16:685–713CrossRefGoogle Scholar
  14. Cai Y, Chen H, Yu R, Shao H, Li Y (2013) An estimation of distribution algorithm for the 3D bin packing problem with various bin sizes. Ideal 2013, vol 8206, pp 401–408Google Scholar
  15. Caprara A, Monaci M (2004) On the 2-dimensional knapsack problem. Oper Res Lett 32:5–14CrossRefGoogle Scholar
  16. Chen Y (2008) A recursive algorithm for constrained two-dimensional cutting problems. Comput Optim Appl 41:337–348CrossRefGoogle Scholar
  17. Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30–44CrossRefGoogle Scholar
  18. Cintra G, Wakabayashi Y (2004) Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In: Ribeiro CC, Martins SL (eds) WEA 2004, LNCS 3059, pp 175–190Google Scholar
  19. Cui Y, Yang L, Chen Q (2013) Heuristic for the rectangular strip packing problem with rotation of items. Comput Oper Res 40:1094–1099CrossRefGoogle Scholar
  20. Cung V, Hifi M, Le Cun B (2000) Constrained two-dimensional guillotine cutting stock problems: a best-first branch-and-bound algorithm. Int Trans Oper Res 7:185–201CrossRefGoogle Scholar
  21. De Bonet JS, Isbell CL, Viola JrP (1996) MIMIC: finding optima by estimating probability densities advances in neural information processing systems 9. NIPS, Denver, CO, USA, 2–5 Dec 1996Google Scholar
  22. Dolatabadi M, Lodi A, Monaci M (2012) Exact algorithms for the two-dimensional guillotine knapsack. Comput Oper Res 39:48–53CrossRefGoogle Scholar
  23. Egeblad J, Pisinger D (2009) Heuristic approaches for the two- and three-dimensional knapsack packing problem. Comput Oper Res 36(4):1026–1049CrossRefGoogle Scholar
  24. Etxeberria R, Larranaga P (1999) Global optimization using Bayesian networks. In: Rodriguez MR, Ortiz S, Hermida RS (eds) Second symposium on artificial intelligence (CIMAF-99). Habana, Cuba, pp 332–339Google Scholar
  25. Fayard D, Hifi M, Zissimopoulos V (1998) An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J Oper Res Soc 49:1270–1277CrossRefGoogle Scholar
  26. Fekete SP, Schepers J (1997) On more-dimensional packing III: Exact algorithms. Technical Report ZPR97-290, Mathematisches Institut, Universität zu KölnGoogle Scholar
  27. Fekete SP, Schepers J, van der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55:569–587CrossRefGoogle Scholar
  28. Gao S, Qiu L, Cungen C (2014) Estimation of distribution algorithms for knapsack problem. J Softw 9(1):104–110Google Scholar
  29. Gonçalves JF, Resende MGC (2006) A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem. AT&T Labs Research Technical report TD-&UNQN6Google Scholar
  30. Hadjiconstantinou E, Christofides N (1995) An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur J Oper Res 83:39–56CrossRefGoogle Scholar
  31. Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. IlliGAL technical report Illinois Genetic Algorithms Laboratory UrbanaGoogle Scholar
  32. Hifi M (1997) An improvement of Viswanathan and Bagchi’s exact algorithm for constrained two-dimensional cutting stock. Comput Oper Res 24(8):727–736CrossRefGoogle Scholar
  33. Lai KK, Chan JWM (1997) An evolutionary algorithm for the rectangular cutting stock problem. Int J Ind Eng 4:130–139Google Scholar
  34. Leung SCH, Zhang D, Zhou C, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(2012):64–73CrossRefGoogle Scholar
  35. Morabito R, Arenales M (1996) Staged and constrained two-dimensional guillotine cutting problems: an AND/OR- graph approach. Eur J Oper Res 94:548–560CrossRefGoogle Scholar
  36. Mühlenbein H, Mahnig T (1999) FDA—a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol Comput 7(4):353–376CrossRefGoogle Scholar
  37. Ocenasek J (2002) Parallel estimation of distribution algorithms. Ph.D. thesis, Brno University of TechnologyGoogle Scholar
  38. Oliveira JF, Ferreira JS (1990) An improved version of Wang’s algorithm for two-dimensional cutting problems. Eur J Oper Res 44:256–266CrossRefGoogle Scholar
  39. Parada V, Munoz R, Gomes A (1995) A hybrid genetic algorithm for the two-dimensional cutting problem. In: Biethahn J, Nissen V (eds) Evolutionary algorithms in management applications. Springer, BerlinGoogle Scholar
  40. Pelikan M, Goldberg DE, Cantú-Paz E (1999) BOA: the Bayesian optimization algorithm. In: Proceedings of the genetic and evolutionary computation conference (GECCO-99), pp 525–532Google Scholar
  41. Pelikan M, Hauschild MW, Lobo FG (2012) Introduction to estimation of distribution algorithms medal report No. 2012003 University of Missouri-St. LouisGoogle Scholar
  42. Pham N (2011) Investigations of constructive approaches for examination timetabling and 3D-strip packing. Ph.D. thesis, University of NottinghamGoogle Scholar
  43. Vasco FJ (1989) A computational improvement to Wangs’s two-dimensional cutting stock algorithm. Comput Ind Eng 16(1):109–115CrossRefGoogle Scholar
  44. Viswanathan KV, Bagchi A (1993) Best-first search methods for constrained two-dimensional cutting stock problems. Oper Res 41(4):768–776CrossRefGoogle Scholar
  45. Wang PY (1983) Two algorithms for constrained two-dimensional cutting stock problems. Oper Res 31:573–586CrossRefGoogle Scholar
  46. Wei L, Lim A (2015) A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. Eur J Oper Res 242:63–71CrossRefGoogle Scholar
  47. Wei L, Tian T, Zhu W, Lim A (2014) A block-based layer building approach for the 2D guillotine strip packing problem. Eur J Oper Res 239:58–69CrossRefGoogle Scholar
  48. Wu YL, Huang W, Lau SC, Wong CK, Young GH (2002) An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res 41:341–358CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Business EconomicsUniversity of PecsPecsHungary

Personalised recommendations