Skip to main content
SpringerLink
Log in

A MIP-based slicing heuristic for three-dimensional bin packing

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The mixed-case palletization problem is a common problem in warehousing and logistics where boxes of rectangular shapes are stacked on top of each other to form pallets. The problem shares common features with three-dimensional bin packing but requires boxes to be adequately supported. We propose a mixed integer programming formulation that maximizes the density of the bottom layers and the compactness of the pallet to ensure stability for top layers. We use a relative-position formulation with slicing that minimizes height, maximizes the fill rate of slices, and pushes boxes towards the vertical axis in order to consolidate fragmented space. Apart from common non-overlap and dimension-related constraints, we explicitly model the fill rates and force lower slices to have an equal or higher density than upper slices. As expected, the formulation could only handle small instances. To tackle larger instances, we embedded the formulation in an iterative approach that packs subsets of boxes sequentially. The approach was found to provide stable pallets and to outperform the branch-and-bound approach of Martello et al. (Oper Res 48(2):256–267, 2000).

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Allen, S., Burke, E., Marecek, J.: A space-indexed formulation of packing boxes into a larger box. Oper. Res. Lett. 40, 20–24 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  2. Amossen, R., Pisinger, D.: Multi-dimensional bin packing problems with guillotine constraints. Comput. Oper Res. 37(11), 1999–2006 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bischoff, E.: Three-dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. 168(3), 952–966 (2006)

    Article  MATH  Google Scholar 

  4. Bischoff, E., Ratcliff, M.: Issues in the development of approaches to container loading. Omega 23(4), 377–390 (1995)

    Article  Google Scholar 

  5. Bortfeldt, A., Wäscher, G.: Constraints in container loading-a state-of-the-art review. Eur. J. Oper. Res. 229(1), 1–20 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, C., Lee, S., Shen, Q.: An analytical model for the container loading problem. Eur. J. Oper. Res. 80(1), 68–76 (1995)

    Article  MATH  Google Scholar 

  7. Crainic, T., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. Inf. J. Comput. 20(3), 368–384 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Crainic, T., Perboli, G., Tadei, R.: Ts2pack: a two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195(3), 744–760 (2009)

    Article  MATH  Google Scholar 

  9. Den Boef, E., Korst, J., Martello, S., Pisinger, D., Vigo, D.: Erratum to the three-dimensional bin packing problem: robot-packable and orthogonal variants of packing problems. Oper. Res. 53(4), 735–736 (2005)

    Article  MATH  Google Scholar 

  10. Faina, L.: A global optimization algorithm for the three-dimensional packing problem. Eur. J. Oper. Res. 126(2), 340–354 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Faröe, O., Pisinger, D., Zachariasen, M.: Guided local search for the three-dimensional bin-packing problem. Inf. J. Comput. 15(3), 267–283 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 4, 401418 (1997)

    Article  MATH  Google Scholar 

  13. Gonçalves, J., Resende, M.: A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145(2), 500–510 (2013)

    Article  Google Scholar 

  14. Hifi, M., Negre, S., Wu, L.: Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21(1), 59–79 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  15. Junqueira, L., Morabito, R., Sato Yamashita, D.: Mip-based approaches for the container loading problem with multi-drop constraints. Ann. Oper. Res. 199, 51–57 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141(2), 410–420 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Martello, S., Pisinger, D., Vigo, D., Boef, E.D., Korst, J.: Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Softw. 33(1), 1–12 (2007)

    Article  MATH  Google Scholar 

  19. Meller, R., Narayanan, V., Vance, P.: Optimal facility layout design. Oper. Res. Lett. 23(3), 117–127 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Mohanty, B., Mathur, K., Ivancic, N.: Value considerations in three-dimensional packinga heuristic procedure using the fractional knapsack problem. Eur. J. Oper. Res. 74(1), 143–151 (1994)

    Article  MATH  Google Scholar 

  21. Paquay, C., Schyns, M., Limbourg, S.: A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. Int. Trans. Oper. Res. 23, 187–213 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  22. Parreño, F., Alvarez-Valdes, R., Tamarit, J.M., Oliveira, J.F.: A maximal-space algorithm for the container loading problem. Inf. J. Comput. 20, 412–422 (2008)

  23. Parreño, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M.: Neighborhood structures for the container loading problem: a VNS implementation. J. Heuristics 16, 1–22 (2010)

  24. Pimpawat, C., Chaiyaratana, N.: Using a co-operative co-evolutionary genetic algorithm to solve a three-dimensional container loading problem. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 2, pp. 1197–1204. IEEE (2001)

  25. Tao, Y., Wang, F.: An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput. Oper. Res. 55, 500–510 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  26. Wäscher, G., Hauner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)

    Article  MATH  Google Scholar 

  27. Wu, Y., Li, W., Goh, M., de Souza, R.: Three-dimensional bin packing problem with variable bin height. Eur. J. Oper. Res. 202(2), 347–355 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  28. Zhao, X., Bennell, J., Bektaş, T., Dowsland, K.: A comparative review of 3D container loading algorithm. Int. Trans. Oper. Res. 23(1), 287–320 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  29. Zhu, W., Huang, W., Lim, A.: A prototype column generation strategy for the multiple container loading problem. Eur. J. Oper. Res. 223(1), 27–39 (2012)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

We thank three anonymous referees for their valuable feedback and comments that greatly helped improve the paper. The research was funded by the Natural Sciences and Engineering Research Council of Canada, DG#103141.

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, ON, Canada

    Samir Elhedhli, Fatma Gzara & Yi Feng Yan

Authors
  1. Samir Elhedhli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fatma Gzara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi Feng Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Samir Elhedhli.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Elhedhli, S., Gzara, F. & Yan, Y.F. A MIP-based slicing heuristic for three-dimensional bin packing. Optim Lett 11, 1547–1563 (2017). https://doi.org/10.1007/s11590-017-1154-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1154-5

Keywords

Search

Navigation