Advertisement

A Modeling-Based Approach for Non-standard Packing Problems

  • Giorgio FasanoEmail author
Chapter
Part of the Springer Optimization and Its Applications book series (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).

Keywords

Tetris-like items Orthogonal packing Convex domain Additional/balancing conditions Mixed integer linear/nonlinear programming models Global optimization (GO) Efficient formulation Feasibility sub-problem Space-indexed/grid-based-position paradigms Polygon approximation Heuristics 

Notes

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.

References

  1. 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. 2.
    Cassioli, A., Locatelli, M.: A heuristic approach for packing identical rectangles in convex regions. Comput. Oper. Res. 38(9), 1342–1350 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Padberg, M.W.: Packing small boxes into a big box. Office of Naval Research, N00014-327, New York University (1999)Google Scholar
  5. 5.
    Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discret. Optim. 2(2), 154–167 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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)CrossRefzbMATHGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49–64 (1985)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83(1), 39–56 (1995)CrossRefzbMATHGoogle Scholar
  11. 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. 12.
    Birgin, E.G., Lobato, R.D.: Orthogonal packing of identical rectangles within isotropic convex regions. Comput. Ind. Eng. 59(4), 595–602 (2010)CrossRefGoogle Scholar
  13. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 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. 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

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Thales Alenia Space Italia S.p.A.TurinItaly

Personalised recommendations