Skip to main content

Greedy Heuristic for Optimized Placement of Orthogonal Polyhedra in Irregular Cutting and Packing Problems

  • Conference paper
  • First Online:
Advances in Mechanical Engineering (MMESE 2023)

Abstract

The article discusses NP-hard optimization problems of irregular cutting and problems of packing objects of arbitrary geometry. When placing objects, their representation in the form of orthogonal polyhedra is used, obtained after applying voxelization algorithms to given models of objects of complex shape. A greedy heuristic for the placement of two- and three-dimensional orthogonal polyhedra is proposed, which ensures the selecting of the best orientation variant for each object to be placed when searching for the densest placement scheme. The analysis of the effectiveness of the application of this greedy placement heuristic on the problems of flat irregular cutting and packing of three-dimensional objects of non-regular shape is carried out. The application of the proposed greedy heuristic provides fast obtaining if high quality solutions to the problems of packing a large number of objects represented in the form of orthogonal polyhedra. It is shown that the best solutions are obtained as a result of the joint application of the genetic algorithm and the proposed heuristic.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.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. Leao, A.A., Toledo, F.M., Oliveira, J.F., Carravilla, M.A., Alvarez-Valdés, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803–822 (2020)

    Article  MathSciNet  Google Scholar 

  2. Byholm, T., Toivakka, M., Westerholm, J.: Effective packing of 3-dimensional voxel-based arbitrarily shaped particles. Powder Technol. 196(2), 139–146 (2009)

    Article  Google Scholar 

  3. Araújo, L.J., Özcan, E., Atkin, J.A., Baumers, M.: Analysis of irregular three-dimensional packing problems in additive manufacturing: a new taxonomy and dataset. Int. J. Prod. Res. 57(18), 5920–5934 (2019)

    Article  Google Scholar 

  4. Plankovskyy, S., Tsegelnyk, Y., Shypul, O., Pankratov, A., Romanova, T.: Cutting irregular objects from the rectangular metal sheet. In: Nechyporuk, M., Pavlikov, V., Kritskiy, D. (eds.) Integrated Computer Technologies in Mechanical Engineering, vol. 1113, pp. 150–157. Springer, Cham (2020)

    Chapter  Google Scholar 

  5. Brovkina, Y.I., Sobolev, A.N., Nekrasov, A.Y.: Research of characteristics and parameters of cycloidal gear. In: Radionov, A., Kravchenko, O., Guzeev, V., Rozhdestvenskiy, Y. (eds.) Proceedings of the 4th International Conference on Industrial Engineering. ICIE 2018. Lecture Notes in Mechanical Engineering, pp. 1169–1179. Springer, Cham (2019)

    Google Scholar 

  6. Johnson, D.S.: A brief history of NP-completeness, 1954–2012. Documenta Mathematica Extra Volume ISMP, pp. 359–376 (2012)

    Google Scholar 

  7. Alvarez-Valdes, R., Carravilla, M.A., Oliveira, J.F.: Cutting and packing. In: Handbook of Heuristics, pp. 931–977. Springer, Cham (2018)

    Google Scholar 

  8. Zhao, Y., Rausch, C., Haas, C.: Optimizing 3D irregular object packing from 3D scans using metaheuristics. Adv. Eng. Inform. 47, 101234 (2021)

    Article  Google Scholar 

  9. Chekanin, V.A., Chekanin, A.V.: Design of library of metaheuristic algorithms for solving the problems of discrete optimization. In: Evgrafov, A. (eds.) Advances in Mechanical Engineering. Lecture Notes in Mechanical Engineering, pp. 25–32. Springer, Cham (2018)

    Google Scholar 

  10. Chernov, N., Stoyan, Y., Romanova, T.: Mathematical model and efficient algorithms for object packing problem. Comput. Geom. 43(5), 535–553 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Verkhoturov, M., Verkhoturova, G., Yagudin, R., Danilov, K., Karimov, R., Kondratyeva, N.V., Valeev, S.S.: Optimization of placement in the tasks of rapid prototyping and manufacturing of volumetric parts based on additive technologies. In: CEUR Workshop Proceedings, vol. 2638, pp. 298–305 (2020)

    Google Scholar 

  13. Klevanskiy, N.N., Tkachev, S.I., Voloshchuk, L.A., Nourgaziev, R.B., Mavzovin, V.S.: Regular two-dimensional packing of congruent objects: cognitive analysis of honeycomb constructions. Appl. Sci. 11(11), 5128 (2021)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Lebedev, P.D., Ushakov, V.N., Uspenskii, A.A.: Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary. J. Appl. Ind. Math. 14(4), 681–692 (2020)

    Article  MathSciNet  Google Scholar 

  16. Tolok, A.V., Tolok, N.B.: Mathematical programming problems solving by functional voxel method. Autom. Remote Control. 79(9), 1703–1712 (2018). https://doi.org/10.1134/S0005117918090138

    Article  MathSciNet  Google Scholar 

  17. Beiresh, A., Razumowsky, A.: The system for modeling and visualizing 3D algebraic functions. In: International School on Neural Networks, Initiated by IIASS and EMFCSC, pp. 958–993. Springer, Cham (2022)

    Google Scholar 

  18. Lamas Fernandez, C., Bennell, J., Martinez Sykora, A.: Voxel-based solution approaches to the three-dimensional irregular packing problem. Oper. Res. 71(4), 1298–1317 (2021)

    Article  MathSciNet  Google Scholar 

  19. Tun, Y.W., Markin, L.V.: Methods of formation of receptor (voxel) geometric models for automated layout tasks. In: IOP Conference Series: Materials Science and Engineering, vol. 687, no. 4, p. 044050 (2019)

    Google Scholar 

  20. Chekanin, V.A., Chekanin, A.V.: (2021) Solving the problem of decomposition of an orthogonal polyhedron of arbitrary dimension. In: Evgrafov, A.N. (ed.) Advances in Mechanical Engineering. MMESE 2020. Lecture Notes in Mechanical Engineering, pp. 52–59. Springer, Cham

    Google Scholar 

  21. Chekanin, V., Chekanin, A.: Algorithms for working with orthogonal polyhedrons in solving cutting and packing problems. In: CEUR Workshop Proceedings, vol. 3027, pp. 656–665 (2021)

    Google Scholar 

  22. Chekanin, V.A., Chekanin, A.V.: Development of algorithms for the correct visualization of two-dimensional and three-dimensional orthogonal polyhedrons. In: Radionov, A., Karandaev, A. (eds.) Advances in Automation. RusAutoCon 2019. Lecture Notes in Electrical Engineering, vol. 641, pp. 891–900. Springer, Cham (2020)

    Google Scholar 

  23. Chekanin, V.A., Chekanin, A.V.: An overview of methods to form orthogonal polyhedra for the problems of packing objects of complex shape. In: Evgrafov, A.N. (eds.) Advances in Mechanical Engineering. Lecture Notes in Mechanical Engineering, pp. 203–212. Springer, Cham (2023)

    Google Scholar 

  24. Chekanin, V.A., Chekanin, A.V.: Solving the problem of dense packing of objects of complex geometry. In: Evgrafov, A.N. (eds.) Advances in Mechanical Engineering. Lecture Notes in Mechanical Engineering, pp. 108–116. Springer, Cham (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladislav A. Chekanin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 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

Chekanin, V.A., Chekanin, A.V. (2024). Greedy Heuristic for Optimized Placement of Orthogonal Polyhedra in Irregular Cutting and Packing Problems. In: Evgrafov, A.N. (eds) Advances in Mechanical Engineering. MMESE 2023. Lecture Notes in Mechanical Engineering. Springer, Cham. https://doi.org/10.1007/978-3-031-48851-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48851-1_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48850-4

  • Online ISBN: 978-3-031-48851-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics