IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v28y2011i06ns0217595911003326.html
   My bibliography  Save this article

Greedy Algorithms For Packing Unequal Spheres Into A Cuboidal Strip Or A Cuboid

Author

Listed:
  • TIMO KUBACH

    (Department of Information Systems, University of Hagen, Germany;
    Profilstrasse 8, 58084 Hagen, Germany)

  • ANDREAS BORTFELDT

    (Department of Information Systems, University of Hagen, Germany;
    Profilstrasse 8, 58084 Hagen, Germany)

  • THOMAS TILLI

    (Department of Information Systems, University of Hagen, Germany;
    Profilstrasse 8, 58084 Hagen, Germany)

  • HERMANN GEHRING

    (Department of Information Systems, University of Hagen, Germany;
    Profilstrasse 8, 58084 Hagen, Germany)

Abstract

Given a finite set of spheres of different sizes, we study the three-dimensional Strip Packing Problem (3D-SPP) as well as the three-dimensional Knapsack Problem (3D-KP). The 3D-SPP asks for a placement of all spheres within a cuboidal strip of fixed width and height so that the variable length of the cuboidal strip is minimized. The 3D-KP requires packing of a subset of the spheres in a given cuboid so that the wasted space is minimized. To solve these problems two greedy algorithms were developed which adapt the algorithms proposed by Huanget al.(2005) to the 3D case with some important enhancements. The resulting methods were tested using the instances provided by Stoyanet al.(2003). Additionally, two series of 12 instances each for the 3D-SPP and for the 3D-KP are introduced and results for these new instances are also reported.

Suggested Citation

  • Timo Kubach & Andreas Bortfeldt & Thomas Tilli & Hermann Gehring, 2011. "Greedy Algorithms For Packing Unequal Spheres Into A Cuboidal Strip Or A Cuboid," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(06), pages 739-753.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:06:n:s0217595911003326
    DOI: 10.1142/S0217595911003326
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003326
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003326?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.

    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:wsi:apjorx:v:28:y:2011:i:06:n:s0217595911003326. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.