Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets
Our research objective is to lower intralogistics costs by minimizing the number of shuffling operations in a steel plant company commercial warehouse. The process of dispatching products consists of retrieving set of steel bar (SSB) from a floor stored stack or a special stacking frame by an overhe...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-10-01
|
| Series: | Logistics & Sustainable Transport |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/jlst-2018-0008 |
| _version_ | 1797962963898859520 |
|---|---|
| author | Marolt Jakob Lerher Tone |
| author_facet | Marolt Jakob Lerher Tone |
| author_sort | Marolt Jakob |
| collection | DOAJ |
| description | Our research objective is to lower intralogistics costs by minimizing the number of shuffling operations in a steel plant company commercial warehouse. The process of dispatching products consists of retrieving set of steel bar (SSB) from a floor stored stack or a special stacking frame by an overhead crane. To retrieve a targeted merchandise all SSB above targeted must be reshuffled. Proper assignment of storage locations is a key logistics problem for efficient order picking. We are comparing two heuristics, that do not require information of dispatching sequence of any stored products. We simulated the problem at hand with both methods. Our objective is to count the number of reshuffles using each heuristic on randomly generated examples and decide which is better in the long run. Our problem has similarities with storage assignment of steel plates or steel coils for minimization of reshuffling operations. The problem is also comparable to storage assignment of containers in a container yard. In our case we are dealing with a special stacking configuration of products, that demands different approach. We want to demonstrate which heuristic should be used in companies that lack necessary storage information infrastructure. |
| first_indexed | 2024-04-11T01:20:52Z |
| format | Article |
| id | doaj.art-ab3456320d454a3ea1a4203e04b7fbc7 |
| institution | Directory Open Access Journal |
| issn | 2232-4968 |
| language | English |
| last_indexed | 2024-04-11T01:20:52Z |
| publishDate | 2018-10-01 |
| publisher | Sciendo |
| record_format | Article |
| series | Logistics & Sustainable Transport |
| spelling | doaj.art-ab3456320d454a3ea1a4203e04b7fbc72023-01-03T11:24:49ZengSciendoLogistics & Sustainable Transport2232-49682018-10-0192374510.2478/jlst-2018-0008jlst-2018-0008Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar SetsMarolt Jakob0Lerher Tone1University of Maribor/Faculty of Logistics, Celje, SloveniaUniversity of Maribor/Faculty of Logistics, Celje, SloveniaOur research objective is to lower intralogistics costs by minimizing the number of shuffling operations in a steel plant company commercial warehouse. The process of dispatching products consists of retrieving set of steel bar (SSB) from a floor stored stack or a special stacking frame by an overhead crane. To retrieve a targeted merchandise all SSB above targeted must be reshuffled. Proper assignment of storage locations is a key logistics problem for efficient order picking. We are comparing two heuristics, that do not require information of dispatching sequence of any stored products. We simulated the problem at hand with both methods. Our objective is to count the number of reshuffles using each heuristic on randomly generated examples and decide which is better in the long run. Our problem has similarities with storage assignment of steel plates or steel coils for minimization of reshuffling operations. The problem is also comparable to storage assignment of containers in a container yard. In our case we are dealing with a special stacking configuration of products, that demands different approach. We want to demonstrate which heuristic should be used in companies that lack necessary storage information infrastructure.https://doi.org/10.2478/jlst-2018-0008index terms: order pickingshuffling operationssets of steel barsstorage assignment |
| spellingShingle | Marolt Jakob Lerher Tone Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets Logistics & Sustainable Transport index terms: order picking shuffling operations sets of steel bars storage assignment |
| title | Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets |
| title_full | Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets |
| title_fullStr | Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets |
| title_full_unstemmed | Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets |
| title_short | Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets |
| title_sort | comparison of lowest slot and nearest stack heuristics for storage assignment of steel bar sets |
| topic | index terms: order picking shuffling operations sets of steel bars storage assignment |
| url | https://doi.org/10.2478/jlst-2018-0008 |
| work_keys_str_mv | AT maroltjakob comparisonoflowestslotandneareststackheuristicsforstorageassignmentofsteelbarsets AT lerhertone comparisonoflowestslotandneareststackheuristicsforstorageassignmentofsteelbarsets |