Skip to main content

A Modeling-Based Approach for Non-standard Packing Problems

  • Chapter
Optimized Packings with Applications

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 105))

Abstract

This chapter examines the problem of packing tetris-like items, orthogonally, with the possibility of rotations, into a convex domain, in the presence of additional conditions. An MILP (Mixed Integer Linear Programming) and an MINLP (Mixed Integer Nonlinear Programming) models, previously studied by the author (Fasano, Solving Non-standard Packing Problems by Global Optimization and Heuristics. SpringerBriefs in Optimization, Springer Science + Business Media, New York, 2014), are surveyed. An efficient formulation of the objective function, aimed at maximizing the loaded cargo, is pointed out for the MILP model. The MINLP one, addressed to the relevant feasibility sub-problem, has been conceived to improve approximate solutions, as an intermediate step of a heuristic process. A space-indexed model is further introduced and the problem of approximating polygons by means of tetris-like items investigated. In both cases an MILP formulation has been adopted. An overall heuristic approach is proposed to provide effective solutions in practice. One chapter of this book focuses on the relevant computational aspects (Gliozzi et al., Container loading problem MIP-based heuristics solved by CPLEX: an experimental analysis. In: Fasano, G., Pintér, J.D. (eds.) Optimized Packings and Their Applications. Springer Optimization and Its Applications, Springer Science + Business Media, New York, 2015).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. SpringerBriefs in Optimization, Springer Science + Business Media, New York (2014)

    Google Scholar 

  2. Cassioli, A., Locatelli, M.: A heuristic approach for packing identical rectangles in convex regions. Comput. Oper. Res. 38(9), 1342–1350 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  4. Padberg, M.W.: Packing small boxes into a big box. Office of Naval Research, N00014-327, New York University (1999)

    Google Scholar 

  5. Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discret. Optim. 2(2), 154–167 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Stoyan, Y.G., Chugay, A.M.: Packing cylinders and rectangular cuboids with distances between them into a given region. Eur. J. Oper. Res. 197, 446–455 (2009)

    Article  MATH  Google Scholar 

  7. Stoyan, Y.G., Zlotnik, M.V., Chugay, A.M.: Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region. J. Oper. Res. Soc. 63(3), 379–391 (2012)

    Article  Google Scholar 

  8. Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighborhood search for two-and three-dimensional nesting problems. Eur. J. Oper. Res. 183(3), 1249–1266 (2007)

    Article  MathSciNet  Google Scholar 

  9. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49–64 (1985)

    Article  MathSciNet  Google Scholar 

  10. Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83(1), 39–56 (1995)

    Article  MATH  Google Scholar 

  11. Gliozzi, S., Castellazzo, A., Fasano, G.: Container loading problem MIP-based heuristics solved by CPLEX: an experimental analysis. In: Fasano, G., Pintér, J.D. (eds.) Optimized Packings and Their Applications. Springer Optimization and Its Applications. Springer Science + Business Media, New York (2015)

    Google Scholar 

  12. Birgin, E.G., Lobato, R.D.: Orthogonal packing of identical rectangles within isotropic convex regions. Comput. Ind. Eng. 59(4), 595–602 (2010)

    Article  Google Scholar 

  13. Birgin, E., Martinez, J., Nishihara, F.H., Ronconi, D.P.: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Comput. Oper. Res. 33(12), 3535–3548 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Castellazzo, A., Fasano, G., Pintér, J.D.: An MINLP Formulation for The Container Loading Problems: An Experimental Analysis. Working paper, Thales Alenia Space (2015)

    Google Scholar 

  15. Junqueira, L., Morabito, R., Yamashita, D.S., Yanasse, H.H.: Optimization models for the three-dimensional container loading problem with practical constraints. In: Fasano, G., Pintér, J.D. (eds.) Modeling and Optimization in Space Engineering, pp. 271–294. Springer Science +Business Media, New York (2013)

    Google Scholar 

Download references

Acknowledgements

The author wishes to thank Janos D. Pintér for discussing the manuscript in depth. His suggestions have significantly contributed to improve the original version of the work, making several parts easier to read. Special thanks are due to Jane Evans for her invaluable support in revising the whole text, as well as to Alessandro Castellazzo for his accurate review.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giorgio Fasano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Fasano, G. (2015). A Modeling-Based Approach for Non-standard Packing Problems. In: Fasano, G., Pintér, J. (eds) Optimized Packings with Applications. Springer Optimization and Its Applications, vol 105. Springer, Cham. https://doi.org/10.1007/978-3-319-18899-7_4

Download citation

Publish with us

Policies and ethics