OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE
This study considers the one-dimensional variable-sized bin packing problem (VSBPP) which is an NP-Hard problem. In this study, the objective is to find an efficient solution that minimizes both the total capacity of the bins used and the number of bins required, thereby optimizing the company'...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Eskişehir Osmangazi University
2025-04-01
|
| Series: | Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/download/article-file/3710752 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850282597952782336 |
|---|---|
| author | Basel Zbeda Mazen Sımı Husam Jehad Hasan Omar Mhd Hazem Alhammamı Faris Albakar Zehra Düzgit |
| author_facet | Basel Zbeda Mazen Sımı Husam Jehad Hasan Omar Mhd Hazem Alhammamı Faris Albakar Zehra Düzgit |
| author_sort | Basel Zbeda |
| collection | DOAJ |
| description | This study considers the one-dimensional variable-sized bin packing problem (VSBPP) which is an NP-Hard problem. In this study, the objective is to find an efficient solution that minimizes both the total capacity of the bins used and the number of bins required, thereby optimizing the company's storage policy and saving space within the warehouse. Three algorithms are employed to solve a real warehouse’s VSBPP: i) First Fit Decreasing (FFD), ii) Best Fit Decreasing (BFD), and iii) Next Fit Decreasing (NFD). The warehouse dataset includes items of various sizes, and the goal is to allocate these items into bins most efficiently. Experimental results demonstrate that the FFD and BFD algorithms outperform the NFD algorithm. Furthermore, all three algorithms significantly reduce storage space usage and improve space utilization compared to the warehouse's current practices. |
| format | Article |
| id | doaj-art-e2310ec72e0d4c909f387356e81ed0e1 |
| institution | OA Journals |
| issn | 2630-5712 |
| language | English |
| publishDate | 2025-04-01 |
| publisher | Eskişehir Osmangazi University |
| record_format | Article |
| series | Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi |
| spelling | doaj-art-e2310ec72e0d4c909f387356e81ed0e12025-08-20T01:47:57ZengEskişehir Osmangazi UniversityEskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi2630-57122025-04-013311608161710.31796/ogummf.1432654122OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSEBasel Zbeda0https://orcid.org/0009-0008-5718-330XMazen Sımı1https://orcid.org/0009-0008-0542-0238Husam Jehad Hasan Omar2https://orcid.org/0009-0008-9649-9622Mhd Hazem Alhammamı3https://orcid.org/0009-0004-0147-9823Faris Albakar4https://orcid.org/0009-0001-0614-6030Zehra Düzgit5https://orcid.org/0000-0003-0686-1672İSTANBUL BİLGİ ÜNİVERSİTESİİSTANBUL BİLGİ ÜNİVERSİTESİİSTANBUL BİLGİ ÜNİVERSİTESİİSTANBUL BİLGİ ÜNİVERSİTESİİSTANBUL BİLGİ ÜNİVERSİTESİİSTANBUL BİLGİ ÜNİVERSİTESİThis study considers the one-dimensional variable-sized bin packing problem (VSBPP) which is an NP-Hard problem. In this study, the objective is to find an efficient solution that minimizes both the total capacity of the bins used and the number of bins required, thereby optimizing the company's storage policy and saving space within the warehouse. Three algorithms are employed to solve a real warehouse’s VSBPP: i) First Fit Decreasing (FFD), ii) Best Fit Decreasing (BFD), and iii) Next Fit Decreasing (NFD). The warehouse dataset includes items of various sizes, and the goal is to allocate these items into bins most efficiently. Experimental results demonstrate that the FFD and BFD algorithms outperform the NFD algorithm. Furthermore, all three algorithms significantly reduce storage space usage and improve space utilization compared to the warehouse's current practices.https://dergipark.org.tr/tr/download/article-file/3710752depodeğişken boyutlu kutulama problemii̇lk bulduğun boşluğu dolduren i̇yi boşluğu doldursonraki boşluğu doldurwarehousevariable-sized bin packing problemfirst fit decreasingbest fit decreasingnext fit decreasing |
| spellingShingle | Basel Zbeda Mazen Sımı Husam Jehad Hasan Omar Mhd Hazem Alhammamı Faris Albakar Zehra Düzgit OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi depo değişken boyutlu kutulama problemi i̇lk bulduğun boşluğu doldur en i̇yi boşluğu doldur sonraki boşluğu doldur warehouse variable-sized bin packing problem first fit decreasing best fit decreasing next fit decreasing |
| title | OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE |
| title_full | OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE |
| title_fullStr | OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE |
| title_full_unstemmed | OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE |
| title_short | OPTIMIZATION OF STOCK KEEPING AND SPACE UTILIZATION POLICY FOR A WAREHOUSE |
| title_sort | optimization of stock keeping and space utilization policy for a warehouse |
| topic | depo değişken boyutlu kutulama problemi i̇lk bulduğun boşluğu doldur en i̇yi boşluğu doldur sonraki boşluğu doldur warehouse variable-sized bin packing problem first fit decreasing best fit decreasing next fit decreasing |
| url | https://dergipark.org.tr/tr/download/article-file/3710752 |
| work_keys_str_mv | AT baselzbeda optimizationofstockkeepingandspaceutilizationpolicyforawarehouse AT mazensımı optimizationofstockkeepingandspaceutilizationpolicyforawarehouse AT husamjehadhasanomar optimizationofstockkeepingandspaceutilizationpolicyforawarehouse AT mhdhazemalhammamı optimizationofstockkeepingandspaceutilizationpolicyforawarehouse AT farisalbakar optimizationofstockkeepingandspaceutilizationpolicyforawarehouse AT zehraduzgit optimizationofstockkeepingandspaceutilizationpolicyforawarehouse |