IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v22y2024i4d10.1007_s10288-024-00576-6.html
   My bibliography  Save this article

A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem

Author

Listed:
  • Hamid Salamati-Hormozi

    (Tarbiat Modares University)

  • Ali Husseinzadeh Kashan

    (Tarbiat Modares University)

  • Bakhtiar Ostadi

    (Tarbiat Modares University)

Abstract

This paper introduces the three-dimensional bin packing problem with item fragmentation (3D-BPPIF) and explores its application in the storage location assignment problem (SLAP) to efficiently allocate warehouse spaces to product groups. Based on real-world constraints, the aim is to find an effective 3D-packing of the product groups into warehouse storage spaces to minimize the total distance. Given the internal limitations present in many warehouses, the storage spaces are not homogeneous, making the allocation to product groups a challenging task that can reduce space utilization efficiency. Accordingly, to effectively utilize warehouse storage spaces, we developed a MILP formulation incorporating the concepts of shape changeability and item fragmentation, significantly enhancing the flexibility of the arrangements. Due to the NP-hard nature of the problem, we proposed a simulated annealing-based meta-heuristic to solve large-scale real-world problems. Numerous computational experiments prove the validity of the proposed model and illustrate that the proposed algorithm can provide appropriate 3D assignments.

Suggested Citation

  • Hamid Salamati-Hormozi & Ali Husseinzadeh Kashan & Bakhtiar Ostadi, 2024. "A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem," 4OR, Springer, vol. 22(4), pages 483-536, December.
    • Handle: RePEc:spr:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-024-00576-6
    DOI: 10.1007/s10288-024-00576-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-024-00576-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-024-00576-6?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:spr:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-024-00576-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.