Skip to main content
SpringerLink
Log in

Optimized Packing of Object Clusters with Balancing Conditions

  • Conference paper
  • First Online:
Data Analysis and Optimization for Engineering and Computing Problems

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

  • 237 Accesses

Abstract

Packing clusters composed of non-overlapping non-identical convex objects is considered. The packing problem, originally stated in Romanova et al. (Math Probl Eng 2019:Article ID 4136430, 12 pages, 2019), is extended here by introducing balancing (equilibrium) conditions. Packing clusters into a rectangular container is considered. Objects in the cluster are of the same shape and allowed to be continuously translated and rotated subject to maximum distance between clusters. This problem is referred to as a sparse equilibrium packing of clusters and formulated as a nonlinear optimization problem. An algorithmic approach to find a locally optimal solution is developed. Computational results are presented to support efficiency of the method for packing clusters with and without balancing conditions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. B. Chazelle, H. Edelsbrunner, L.J. Guibas, The complexity of cutting complexes. Discrete Comput. Geom. 4(2), 139–181 (1989)

    Article  MathSciNet  Google Scholar 

  2. I. Litvinchev, L. Infante, L. Ozuna, Approximate packing: Integer programming models, valid inequalities and nesting, in Optimized Packings and Their Applications, ed. by G. Fasano, J. D. Pinter. Springer Optimization and Its Applications, vol. 105 (2015), pp. 117–135

    Google Scholar 

  3. J. Kallrath, S. Rebennack, Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. 59(2), 405–437 (2014)

    Article  MathSciNet  Google Scholar 

  4. Y. Stoyan, A. Pankratov, T. Romanova, Quasi-phi-functions and optimal packing of ellipses. J. Glob. Optim. 65(2), 283–307 (2016)

    Article  MathSciNet  Google Scholar 

  5. E.G. Birgin, R.D. Lobato, J.M. Martinez, Packing ellipsoids by nonlinear optimization. J. Glob. Optim. 65(4), 709–743 (2016)

    Article  MathSciNet  Google Scholar 

  6. A. Pankratov, T. Romanova, I. Litvinchev, Packing ellipses in an optimized rectangular container. Wirel. Netw. (2018). https://doi.org/10.1007/s11276-018-1890-1

  7. F. Kampas, I. Castillo, J. Pintér, Optimized ellipse packings in regular polygons. Optim. Lett. 13(7), 1583–1613 (2019)

    Article  MathSciNet  Google Scholar 

  8. A. Pankratov, T. Romanova, I. Litvinchev, Packing ellipses in an optimized convex polygon. J. Glob. Optim. 75(2), 495–522 (2019)

    Article  MathSciNet  Google Scholar 

  9. P. Stetsyuk, T. Romanova, G. Scheithauer, On the global minimum in a balanced circular packing problem. Optim. Lett. 10, 347–1360 (2016)

    Article  MathSciNet  Google Scholar 

  10. F. Zhanghua, H. Wenqi, Z. Lü, Iterated tabu search for the circular open dimension problem. Eur. J. Oper. Res. 225(2), 236–243 (2013)

    Article  MathSciNet  Google Scholar 

  11. Y. Stoyan, G. Yaskov, Packing equal circles into a circle with circular prohibited areas. Int. J. Comput. Math. 89(10), 355–1369 (2012)

    Article  MathSciNet  Google Scholar 

  12. H. Akeb, M. Hifi, S. Negre, An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2, 373–381 (2011)

    Article  Google Scholar 

  13. R. Torres, J.A. Marmolejo, I. Litvinchev, Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Netw. (2018). https://doi.org/10.1007/s11276-018-1869-y

  14. I. Litvinchev, L. Infante, L. Ozuna, Packing circular like objects in a rectangular container. J. Comput. Syst. Sci. Int. 54(2), 259–267 (2015)

    Article  MathSciNet  Google Scholar 

  15. J. Kallrath, Cutting circles and polygons from area minimizing rectangles. J. Glob. Optim. 43, 299–328 (2009)

    Article  MathSciNet  Google Scholar 

  16. J. Peralta, M. Andretta, J. Oliveira, Packing circles and irregular polygons using separation lines, in Proceedings of the 7th International Conference on Operations Research and Enterprise Systems (ICORES 2018), (2018), pp. 71–77

    Chapter  Google Scholar 

  17. H. Alt, F. Hurtado, Packing convex polygons into rectangular boxe, in JCDCG‘00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry, (Springer, London, 2000), pp. 67–80

    Google Scholar 

  18. H. Alt, M. Berg, C. Knauer, Approximating minimum-area rectangular and convex containers for packing convex polygons. J. Comput. Geom. 8(1), 1–10 (2017)

    MathSciNet  MATH  Google Scholar 

  19. D. Jones, A fully general, exact algorithm for nesting irregular shapes. J. Glob. Optim. 59, 367–404 (2013)

    Article  MathSciNet  Google Scholar 

  20. F.M. Toledo, M.A. Carravilla, C. Ribeiro, J.F. Oliveira, A.M. Gomes, The dotted board model: a new MIP model for nesting irregular shapes. Int. J. Prod. Econ. 145(2), 478–487 (2013)

    Article  Google Scholar 

  21. Y. Stoyan, A. Pankratov, T. Romanova, Cutting and packing problems for irregular objects with continuous rotations: mathematical modeling and nonlinear optimization. J. Oper. Res. Soc. 67(5), 786–800 (2016)

    Article  Google Scholar 

  22. Y. Stoyan, A. Pankratov, T. Romanova, Placement problems for irregular objects: mathematical modeling, optimization and applications, in Optimization Methods and Applications, ed. by S. Butenko, P. M. Pardalos, V. Shylo. Springer Optimization and Its Applications, vol. 180 (2017), pp. 521–559

    Google Scholar 

  23. J. Bennell, G. Scheithauer, Y. Stoyan, T. Romanova, A. Pankratov, Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3), 497–524 (2015)

    Article  MathSciNet  Google Scholar 

  24. A.A.S. Leao, F.M.B. Toledo, J.F. Oliveira, M. Carravilla, R. Alvarez-Valdés, Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803–822 (2019). https://doi.org/10.1016/j.ejor.2019.04.045

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  26. T. Romanova, A. Pankratov, I. Litvinchev, Y. Pankratova, I. Urniaieva, Optimized packing clusters of objects in a rectangular container. Math. Probl. Eng. 2019, Article ID 4136430, 12 pages (2019). https://doi.org/10.1155/2019/4136430

  27. Y. Stoyan, T. Romanova, Mathematical models of placement optimization: two- and three-dimensional problems and applications, in Modeling and Optimization in Space Engineering, ed. by G. Fasano, J. D. Pinter. Springer Optimization and Its Applications, vol. 73 (2012), pp. 363–388

    Google Scholar 

  28. N. Chernov, Y. Stoyan, T. Romanova, A. Pankratov, Phi-functions for 2D objects formed by line segments and circular arcs. Adv. Oper. Res. (2012). https://doi.org/10.1155/2012/346358

  29. T. Romanova, J. Bennell, Y. Stoyan, A. Pankratov, Packing of concave polyhedra with continuous rotations using nonlinear optimization. Eur. J. Oper. Res. 268, 37–53 (2018)

    Article  Google Scholar 

  30. A. Wachter, L.T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25–57 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Modeling and Optimal Design, Institute for Mechanical Engineering Problems of the National Academy of Sciences of Ukraine, Kharkiv, Ukraine

    T. Romanova & A. Pankratov

  2. Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico

    I. Litvinchev

  3. Universidad Panamericana, Facultad de Ingeniería, Ciudad de México, Mexico

    Jose Antonio Marmolejo-Saucedo

Authors
  1. T. Romanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Pankratov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. Litvinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jose Antonio Marmolejo-Saucedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jose Antonio Marmolejo-Saucedo .

Editor information

Editors and Affiliations

  1. Universiti Teknologi Petronas, Seri Iskandar, Malaysia

    Pandian Vasant

  2. Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico

    Igor Litvinchev

  3. Facultad de IngenierÞa, Universidad Panamericana, Ciudad de México, Mexico

    Jose Antonio Marmolejo-Saucedo

  4. Facultad de IngenierÞa, Universidad Panamericana, Ciudad de México, Mexico

    Roman Rodriguez-Aguilar

  5. Facultad de IngenierÞa, Universidad Panamericana, Ciudad de México, Mexico

    Felix Martinez-Rios

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Romanova, T., Pankratov, A., Litvinchev, I., Marmolejo-Saucedo, J.A. (2020). Optimized Packing of Object Clusters with Balancing Conditions. In: Vasant, P., Litvinchev, I., Marmolejo-Saucedo, J.A., Rodriguez-Aguilar, R., Martinez-Rios, F. (eds) Data Analysis and Optimization for Engineering and Computing Problems. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-48149-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-48149-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-48148-3

  • Online ISBN: 978-3-030-48149-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation