Skip to main content
SpringerLink
Log in

A New Search Procedure for the Two-dimensional Orthogonal Packing Problem

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

Abstract

In this paper we propose a new exact procedure for the two-dimensional orthogonal packing problem, based on F. Clautiaux et al. approach (Clautiaux et al. Eur. J. Oper. Res. 183(3), 1196–1211, 2007). The principle consists in searching first the positions of the items on the horizontal axis, so as that, at each position, the sum of the heights of the items does not exceed the height of the bin. Each time a valid placement of all the items is encountered, another procedure determines if it can be extended to a solution of the packing problem, searching the positions of the items on the vertical axis. Novel aspects of our approach include a simple and efficient search procedure, which only generates restricted placements, at least in a first stage, in order to reduce the search space, and the memorization of unsuccessful configurations, which are then used to detect dead-ends. We tested our implementation on a selection of orthogonal packing problems and strip packing problems, and we compared our results with those of recent successful approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: Reactive grasp for the strip-packing problem. Comput.Oper. Res. 35(4), 1065–1083 (2008). doi:10.1016/j.cor.2006.07.004

    Article  MATH  Google Scholar 

  2. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: A branch and bound algorithm for the strip packing problem. OR Spectr. 31, 431–459 (2009)

    Article  MATH  Google Scholar 

  3. Boschetti, M.A., Montaletti, L.: An exact algorithm for the two-dimensional strip-packing problem. Oper. Res. 58, 1774–1791 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Clautiaux, F., Carlier, J., Moukrim, A.: A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1196–1211 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35, 944–959 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Côté, J.F., Dell’Amico, M., Iori, M.: Combinatorial benders’ cuts for the strip packing problem. Oper. Res. 62(3), 643–661 (2014)

    Article  MathSciNet  Google Scholar 

  7. Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci. 38(12), 1803–1818 (1992)

    Article  MATH  Google Scholar 

  8. Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29(2), 353–368 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fekete, S.P., Schepers, J., van der Veen, J.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3), 569–587 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Grandcolas, S., Pinto, C.: A sat encoding for multi-dimensional packing problems. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 6140, pp. 141–146 (2010)

  11. Herz, J.C.: Recursive computational procedure for the two dimensional stock cutting. IBM. J. Res. Dev. 16, 462–469 (1972)

    MathSciNet  MATH  Google Scholar 

  12. Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. Eur. J. Oper. Res. 128, 34–57 (2000)

    Article  Google Scholar 

  13. Huang, E., Korf, R.E.: Optimal rectangle packing: An absolute placement approach. J. Artif. Int. Res. 46(1), 47–87 (2013)

    MathSciNet  MATH  Google Scholar 

  14. Joncour, C., Pêcher, A., Valicov, P.: Mpq-trees for the orthogonal packing problem. J. Math. Model. Algorithms 11(1), 3–22 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact algorithms for the 2-dimensional strip packing problem with and without rotations (2008)

  16. Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. J. Comput. 15(3), 310–319 (2003)

    MathSciNet  MATH  Google Scholar 

  17. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48(2), 256–267 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Stinson, J., Davis, E., Khumawala, B.: Multiple resource-constrained scheduling using branch and bound. AIIE Trans. 10, 252–259 (1978)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSIS – UMR CNRS 7296 Avenue Escadrille Normandie-Niemen, 13397, Marseille Cedex 20, France

    S. Grandcolas & C. Pinto

Authors
  1. S. Grandcolas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Pinto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Grandcolas.

Additional information

This work has been supported by the Region Provence-Alpes-Cote-d’Azur and the ICIA Technologies company http://www.iciatechnologies.com.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grandcolas, S., Pinto, C. A New Search Procedure for the Two-dimensional Orthogonal Packing Problem. J Math Model Algor 14, 343–361 (2015). https://doi.org/10.1007/s10852-015-9278-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-015-9278-z

Keywords

Search

Navigation