SpringerLink
Log in

Two Optimization Techniques for Packing Cylinders

  • Conference paper
  • First Online:
Smart Technologies in Urban Engineering (STUE 2023)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 807))

Included in the following conference series:

  • 82 Accesses

Abstract

In this paper, we investigate the optimization problem of single-layer packing of cylinders into various containers. The relevance and motivation for solving this problem are discussed and existing approaches and algorithms are reviewed. The optimization criterion selected is the maximization of the container packing factor. The problem is considered as a mixed-binary nonlinear programming problem, and a mathematical model is proposed. The general solution strategy is based on constructing a solution tree for binary variables. Two efficient approaches are proposed for searching for approximations to the global extremum of the problem. The choice of strategy depends on the homogeneity of the metric characteristics of the objects being placed. For unequal cylinders, a special decision tree and a way for improving local extrema are applied. For equal cylinders, a statistical optimization method based on neighborhood search is offered. The effectiveness of the proposed approaches is confirmed by numerical examples when optimizing problems of packing homogeneous and heterogeneous cylinder in different containers.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhao C, Jiang L, Teo KL (2020) A hybrid chaos firefly algorithm for three-dimensional irregular packing problem. J Indus Manag Optim 16(1):409–429. https://doi.org/10.3934/jimo.2018160

    Article  MathSciNet  Google Scholar 

  2. Plankovskyy S, Shypul O, Tsegelnyk Y et al (2021) Amplification of heat transfer by shock waves for thermal energy method. In: Nechyporuk M et al (eds) Integrated computer technologies in mechanical engineering—2020. ICTM 2020. LNNS, vol 188. Springer, Cham, pp 577–587. https://doi.org/10.1007/978-3-030-66717-7_49

  3. Deshwal GK, Panjagari NR, Alam T (2019) An overview of paper and paper based food packaging materials: health safety and environmental concerns. J Food Sci Technol 56(10):4391–4403. https://doi.org/10.1007/s13197-019-03950-z

    Article  Google Scholar 

  4. Plankovskyy S, Shypul O, Tsegelnyk Y et al (2021) Circular layout in thermal deburring. In: Shkarlet S et al (eds) Mathematical modeling and simulation of systems (MODS’2020). MODS 2020. AISC, vol 1265. Springer, Cham, pp 111–120. https://doi.org/10.1007/978-3-030-58124-4_11

  5. Brewitz W, Rothfuchs T (2007) Concepts and technologies for radioactive waste disposal in rock salt. Acta Montanistica Slovaca 12:67–74

    Google Scholar 

  6. Sulaiman HF, Sartana BT, Budiyanto U (2019) Genetic algorithm with random crossover and dynamic mutation on bin packing problem. In: Proceedings of the 6th international conference on electrical engineering, computer science and informatics (EECSI), Bandung, Indonesia, pp 229–234. https://doi.org/10.23919/EECSI48112.2019.8976943

  7. Yakovlev S, Kartashov O, Pichugina O, Korobchynskyi K (2019) Genetic algorithms for solving combinatorial mass balancing problem. In: Procedings of the 2nd Ukraine conference on electrical and computer engineering (UKRCON), Lviv, Ukraine, 2019, pp 1061–1064. https://doi.org/10.1109/UKRCON.2019.8879938

  8. Mostaghimi H, Amour BS, Abdul-Kader W (2017) Three-dimensional container loading: a simulated annealing approach. Int J Appl Eng Res 12(7):1290–1304

    Google Scholar 

  9. Wang S, Zhao Q (2022) Probabilistic tabu search algorithm for container liner ship** problem with speed optimization. Int J Prod Res 60(12):3651–3668. https://doi.org/10.1080/00207543.2021.1930236

    Article  Google Scholar 

  10. Dzalbs I, Kalganova T (2020) Accelerating supply chains with ant colony optimization across a range of hardware solutions. Comput Ind Eng 147:106610. https://doi.org/10.1016/j.cie.2020.106610

    Article  Google Scholar 

  11. Bennell JA, Cabo M, Martínez-Sykora A (2018) A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. Eur J Oper Res 270(1):89–102. https://doi.org/10.1016/j.ejor.2018.03.029

    Article  Google Scholar 

  12. Rao Y, Wang P, Luo Q (2021) Hybridizing beam search with tabu search for the irregular packing problem. Math Probl Eng 2021:1–14. https://doi.org/10.1155/2021/5054916

    Article  Google Scholar 

  13. De Souza Queiroz LR, Andretta M (2022) A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. Int Trans Oper Res 29(6):3486–3513. https://doi.org/10.1111/itor.13122

    Article  MathSciNet  Google Scholar 

  14. Hifi M, Mohamed-Youssouf A, Yousef L (2023) A threshold search-based population algorithm for the sphere packing problem. Knowl Based Syst 261. https://doi.org/10.1016/j.knosys.2022.110177

  15. Foroozandeh Z, Shamsi M, de Pinho MdR (2019) A mixed-binary non-linear programming approach for the numerical solution of a family of singular optimal control problems. Int J Control 92(7):1551–1566. https://doi.org/10.1080/00207179.2017.1399216

  16. Stoyan Y, Yaskov G (2021) Optimized packing unequal spheres into a multiconnected domain: mixed-integer non-linear programming approach. Int J Comput Math Comput Syst Theory 6(1):94–111. https://doi.org/10.1080/23799927.2020.1861105

    Article  MathSciNet  Google Scholar 

  17. Yaskov G, Chugay A (2020) Packing equal spheres by means of the block coordinate descent method. In: CEUR workshop proceedings, vol 2608, pp 156–168

    Google Scholar 

  18. Stoian YE, Chugay AM, Pankratov AV et al (2018) Two approaches to modeling and solving the packing problem for convex polytopes. Cybern Syst Anal 54:585–593. https://doi.org/10.1007/s10559-018-0059-3

    Article  MathSciNet  Google Scholar 

  19. Romanova TE, Stetsyuk PI, Chugay AM et al (2019) Parallel computing technologies for solving optimization problems of geometric design. Cybern Syst Anal 55(6):894–904. https://doi.org/10.1007/s10559-019-00199-4

    Article  MathSciNet  Google Scholar 

  20. Stoian Y, Chuhai A (2020) Methodology to solve optimal placement problems for 3D objects. J Mech Eng 23(2):60–71. https://doi.org/10.15407/pmach2020.02.060

  21. Stoyan YG, Scheithauer G, Yaskov GN (2016) Packing unequal spheres into various containers. Cybern Syst Anal 52:419–426. https://doi.org/10.1007/s10559-016-9842-1

    Article  Google Scholar 

  22. Stoyan YG, Socolovsky VZ (1979) The minimization method for some permutation functionals. Inf Process Lett 8(2):110–111. https://doi.org/10.1016/0020-0190(79)90157-1

    Article  Google Scholar 

  23. Grebennik IV, Pankratov AV, Chugay AM, Baranov AV (2010) Packing n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped. Cybern Syst Anal 46:793–802. https://doi.org/10.1007/s10559-010-9260-8

    Article  MathSciNet  Google Scholar 

  24. Specht E The best known solutions of the circular open dimension problem (CODP). http://www.packomania.com. Accessed 13 March 2023

  25. Romanova T et al (2020) Packing convex 3D objects with special geometric and balancing conditions. In: Vasant P et al (eds) Intelligent computing and optimization. ICO 2019. AISC, vol 1072. Springer, Cham, pp 273–281. https://doi.org/10.1007/978-3-030-33585-4_27

  26. Yaskov G, Romanova T, Litvinchev I, Shekhovtsov S (2020) Optimal packing problems: from knapsack problem to open dimension problem. In: Vasant P et al (eds) Intelligent computing and optimization. ICO 2019. AISC, vol 1072. Springer, Cham, pp 671–678. https://doi.org/10.1007/978-3-030-33585-4_65

Download references

Acknowledgement

The research is supported by National Research Foundation of Ukraine (grant #2020.02/0128).

Author information

Authors and Affiliations

  1. Anatolii Pidhornyi Institute of Mechanical Engineering Problems of the National Academy of Sciences of Ukraine, 2/10 Pozharskogo Str., Kharkiv, 61046, Ukraine

    Yuriy Stoyan, Andrii Chuhai, Sergiy Shekhovtsov, Georgiy Yaskov & Mykola Gil

  2. Simon Kuznets Kharkiv National University of Economics, 9A Nauky Avenue, Kharkiv, 61166, Ukraine

    Andrii Chuhai

Authors
  1. Yuriy Stoyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrii Chuhai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergiy Shekhovtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Georgiy Yaskov
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mykola Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergiy Shekhovtsov .

Editor information

Editors and Affiliations

  1. O.M. Beketov National University of Urban Economy in Kharkiv, Kharkiv, Ukraine

    Olga Arsenyeva

  2. A. Pidhornyi Institute of Mechanical Engineering Problems of the National Academy of Sciences of Ukraine, Kharkiv, Ukraine

    Tetyana Romanova

  3. O.M. Beketov National University of Urban Economy in Kharkiv, Kharkiv, Ukraine

    Maria Sukhonos

  4. O.M. Beketov National University of Urban Economy in Kharkiv, Kharkiv, Ukraine

    Ihor Biletskyi

  5. O.M. Beketov National University of Urban Economy in Kharkiv, Kharkiv, Ukraine

    Yevgen Tsegelnyk

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Stoyan, Y., Chuhai, A., Shekhovtsov, S., Yaskov, G., Gil, M. (2023). Two Optimization Techniques for Packing Cylinders. In: Arsenyeva, O., Romanova, T., Sukhonos, M., Biletskyi, I., Tsegelnyk, Y. (eds) Smart Technologies in Urban Engineering. STUE 2023. Lecture Notes in Networks and Systems, vol 807. Springer, Cham. https://doi.org/10.1007/978-3-031-46874-2_12

Download citation

Publish with us

Policies and ethics

Search

Navigation