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

Packing cylinders and rectangular parallelepipeds with distances between them into a given region

Author

Listed:
  • Stoyan, Yu.
  • Chugay, A.

Abstract

This paper considers the problem of packing cylinders and parallelepipeds into a given region so that the height of the occupied part of the region is minimal and the distances between each pair of items, and the distance between each packed item and the frontier of the region must be greater than or equal to given distances. A mathematical model of the problem is built and some characteristics of the mathematical model are investigated. Methods for fast construction of starting points, searching for local minima, and a special non-exhaustive search of local minima to obtain good approximations to a global minimum are offered. A numerical example is given. Runtimes to obtain starting points, local minima and approximations to a global minimum are adduced.

Suggested Citation

  • Stoyan, Yu. & Chugay, A., 2009. "Packing cylinders and rectangular parallelepipeds with distances between them into a given region," European Journal of Operational Research, Elsevier, vol. 197(2), pages 446-455, September.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:2:p:446-455
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00498-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Gehring, H. & Menschner, K. & Meyer, M., 1990. "A computer-based heuristic for packing pooled shipment containers," European Journal of Operational Research, Elsevier, vol. 44(2), pages 277-288, January.
    2. Birgin, E. G. & Martinez, J. M. & Ronconi, D. P., 2005. "Optimizing the packing of cylinders into a rectangular container: A nonlinear approach," European Journal of Operational Research, Elsevier, vol. 160(1), pages 19-33, January.
    3. Bischoff, E. E. & Janetz, F. & Ratcliff, M. S. W., 1995. "Loading pallets with non-identical items," European Journal of Operational Research, Elsevier, vol. 84(3), pages 681-692, August.
    4. Jie Wang, 1999. "Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 453-463, December.
    5. W Q Huang & Y Li & H Akeb & C M Li, 2005. "Greedy algorithms for packing unequal circles into a rectangular container," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 539-548, May.
    6. A. Sutou & Y. Dai, 2002. "Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D," Journal of Optimization Theory and Applications, Springer, vol. 114(3), pages 671-694, September.
    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. Yuriy Stoyan & Georgiy Yaskov, 2012. "Packing congruent hyperspheres into a hypersphere," Journal of Global Optimization, Springer, vol. 52(4), pages 855-868, April.

    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. 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.
    2. 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.
    3. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    4. 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.
    5. 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.
    6. Yaohua He & Yong Wu, 2013. "Packing non-identical circles within a rectangle with open length," Journal of Global Optimization, Springer, vol. 56(3), pages 1187-1215, July.
    7. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    8. Bischoff, E.E., 2006. "Three-dimensional packing of items with limited load bearing strength," European Journal of Operational Research, Elsevier, vol. 168(3), pages 952-966, February.
    9. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    10. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    11. M-K Kang & C-S Jang & K-S Yoon, 2010. "Heuristics with a new block strategy for the single and multiple containers loading problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 95-107, January.
    12. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    13. Eley, Michael, 2002. "Solving container loading problems by block arrangement," European Journal of Operational Research, Elsevier, vol. 141(2), pages 393-409, September.
    14. Pisinger, David, 2002. "Heuristics for the container loading problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 382-392, September.
    15. K A Dowsland & M Gilbert & G Kendall, 2007. "A local search approach to a circle cutting problem arising in the motor cycle industry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 429-438, April.
    16. 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.
    17. 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.
    18. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 461-477, December.
    19. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.
    20. 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.

    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:197:y:2009:i:2:p:446-455. 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.