IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v291y2021i1p84-100.html
   My bibliography  Save this article

Sparsest balanced packing of irregular 3D objects in a cylindrical container

Author

Listed:
  • Romanova, Tatiana
  • Stoyan, Yurij
  • Pankratov, Alexander
  • Litvinchev, Igor
  • Plankovskyy, Sergiy
  • Tsegelnyk, Yevgen
  • Shypul, Olga

Abstract

Sparsest packing for irregular 3D objects is introduced. This problem is motivated by the thermal deburring – modern clean and energy saving technology of removing burrs from machine parts (objects) by detonating gas mixtures in a deburring chamber. The objects in the chamber are placed in a vertical cylindrical rack (container) divided into sub-containers by horizontal shelves rigidly fixed on a thin rod passing through the centre of the rack. To achieve a stable processing quality and the most uniform distribution of thermal and power effects, the parts have to be placed sufficiently distant one from another, as well as from the lateral cylindrical surface of the container. The objects are assigned to specific shelves and are represented by a union of basic convex 3D shapes (e.g., cylinders, prisms, cuboids, cones). The sparsest packing is aimed to place the 3D objects as distant as possible, freely sliding and rotating on the shelves subject to balancing conditions. Using the phi-function technique a corresponding nonlinear programming model is constructed. A solution algorithm is proposed and computational results are presented.

Suggested Citation

  • Romanova, Tatiana & Stoyan, Yurij & Pankratov, Alexander & Litvinchev, Igor & Plankovskyy, Sergiy & Tsegelnyk, Yevgen & Shypul, Olga, 2021. "Sparsest balanced packing of irregular 3D objects in a cylindrical container," European Journal of Operational Research, Elsevier, vol. 291(1), pages 84-100.
    • Handle: RePEc:eee:ejores:v:291:y:2021:i:1:p:84-100
    DOI: 10.1016/j.ejor.2020.09.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720308250
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.09.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    2. Giorgio Fasano, 2015. "A Modeling-Based Approach for Non-standard Packing Problems," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Optimized Packings with Applications, edition 1, chapter 0, pages 67-85, Springer.
    3. Yuri Stoyan & Tatiana Romanova, 2012. "Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Modeling and Optimization in Space Engineering, edition 127, chapter 0, pages 363-388, Springer.
    4. Igor Litvinchev & Edith L. Ozuna, 2012. "Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem," International Journal of Energy Optimization and Engineering (IJEOE), IGI Global, vol. 1(1), pages 59-71, January.
    5. Luiz J.P. Araújo & Ender Özcan & Jason A.D. Atkin & Martin Baumers, 2019. "Analysis of irregular three-dimensional packing problems in additive manufacturing: a new taxonomy and dataset," International Journal of Production Research, Taylor & Francis Journals, vol. 57(18), pages 5920-5934, September.
    6. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    7. Yuriy Stoyan & Tatiana Romanova & Alexander Pankratov & Anna Kovalenko & Peter Stetsyuk, 2016. "Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Space Engineering, pages 369-400, Springer.
    8. Yuriy Stoyan & Tatiana Romanova & Alexander Pankratov & Andrey Chugay, 2015. "Optimized Object Packings Using Quasi-Phi-Functions," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Optimized Packings with Applications, edition 1, chapter 0, pages 265-293, Springer.
    9. Bortfeldt, Andreas & Gehring, Hermann, 2001. "A hybrid genetic algorithm for the container loading problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 143-161, May.
    10. Romanova, Tatiana & Litvinchev, Igor & Pankratov, Alexander, 2020. "Packing ellipsoids in an optimized cylinder," European Journal of Operational Research, Elsevier, vol. 285(2), pages 429-443.
    11. Yuriy Stoyan & Alexandr Pankratov & Tatiana Romanova & Giorgio Fasano & János D. Pintér & Yurij E. Stoian & Andrey Chugay, 2019. "Optimized Packings in Space Engineering Applications: Part I," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Modeling and Optimization in Space Engineering, pages 395-437, Springer.
    12. Yu. Stoyan & I. Grebennik & T. Romanova & A. Kovalenko, 2019. "Optimized Packings in Space Engineering Applications: Part II," Springer Optimization and Its Applications, in: Giorgio Fasano & János D. Pintér (ed.), Modeling and Optimization in Space Engineering, pages 439-457, Springer.
    13. A. S. Gogate & S. S. Pande, 2008. "Intelligent layout planning for rapid prototyping," International Journal of Production Research, Taylor & Francis Journals, vol. 46(20), pages 5607-5631, January.
    14. Romanova, T. & Bennell, J. & Stoyan, Y. & Pankratov, A., 2018. "Packing of concave polyhedra with continuous rotations using nonlinear optimisation," European Journal of Operational Research, Elsevier, vol. 268(1), pages 37-53.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hu, Zhi-Hua & Zheng, Yu-Xin & Wang, You-Gan, 2022. "Packing computing servers into the vessel of an underwater data center considering cooling efficiency," Applied Energy, Elsevier, vol. 314(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexander Pankratov & Tatiana Romanova & Igor Litvinchev, 2020. "Packing Oblique 3D Objects," Mathematics, MDPI, vol. 8(7), pages 1-17, July.
    2. Josef Kallrath & Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Luis Infante, 2023. "Packing convex polygons in minimum-perimeter convex hulls," Journal of Global Optimization, Springer, vol. 85(1), pages 39-59, January.
    3. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2023. "Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    4. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    5. Yizhe Yang & Bingshan Liu & Haochen Li & Xin Li & Gong Wang & Shan Li, 2023. "A nesting optimization method based on digital contour similarity matching for additive manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 34(6), pages 2825-2847, August.
    6. Jose M. Framinan & Paz Perez-Gonzalez & Victor Fernandez-Viagas, 2023. "An overview on the use of operations research in additive manufacturing," Annals of Operations Research, Springer, vol. 322(1), pages 5-40, March.
    7. Romanova, Tatiana & Litvinchev, Igor & Pankratov, Alexander, 2020. "Packing ellipsoids in an optimized cylinder," European Journal of Operational Research, Elsevier, vol. 285(2), pages 429-443.
    8. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    9. Yizhe Yang & Bingshan Liu & Haochen Li & Xin Li & Xiaodong Liu & Gong Wang, 2023. "Automatic selection system of the building orientation based on double-layer priority aggregation multi-attribute decision-making," Journal of Intelligent Manufacturing, Springer, vol. 34(5), pages 2477-2493, June.
    10. Kumar, Akhilesh & Prakash & Tiwari, M.K. & Shankar, Ravi & Baveja, Alok, 2006. "Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1043-1069, December.
    11. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    12. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    13. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    14. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    15. A. Pankratov & T. Romanova & I. Litvinchev, 2019. "Packing ellipses in an optimized convex polygon," Journal of Global Optimization, Springer, vol. 75(2), pages 495-522, October.
    16. Josef Kallrath & Joonghyun Ryu & Chanyoung Song & Mokwon Lee & Deok-Soo Kim, 2021. "Near optimal minimal convex hulls of disks," Journal of Global Optimization, Springer, vol. 80(3), pages 551-594, July.
    17. Tian, Tian & Zhu, Wenbin & Lim, Andrew & Wei, Lijun, 2016. "The multiple container loading problem with preference," European Journal of Operational Research, Elsevier, vol. 248(1), pages 84-94.
    18. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    19. He, Kun & Ji, Pengli & Li, Chumin, 2015. "Dynamic reduction heuristics for the rectangle packing area minimization problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 674-685.
    20. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:291:y:2021:i:1:p:84-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.