How to optimize storage classes in a unit-load warehouse
We study a problem of optimizing storage classes in a unit-load warehouse such that the total travel cost is minimized. This is crucial to the operational efficiency of unit-load warehouses, which constitute a crit- ical part of a supply chain. We propose a novel approach called the FB method to sol...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/4541 https://ink.library.smu.edu.sg/context/lkcsb_research/article/5540/viewcontent/class.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.lkcsb_research-5540 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.lkcsb_research-55402019-09-16T01:14:51Z How to optimize storage classes in a unit-load warehouse ANG, Marcus LIM, Yun Fong We study a problem of optimizing storage classes in a unit-load warehouse such that the total travel cost is minimized. This is crucial to the operational efficiency of unit-load warehouses, which constitute a crit- ical part of a supply chain. We propose a novel approach called the FB method to solve the problem. The FB method is suitable for general receiving-dock and shipping-dock locations that may not coincide. The FB method first ranks the locations according to the frequencies that they are visited, which are estimated by a linear program based on the warehouse’s layout as well as the products’ arrivals and demands. The method then sequentially groups the locations into a number of classes that is implementable in prac- tice. After forming the classes, we use a policy based on robust optimization to determine the storage and retrieval decisions. We compare the robust policy with the traditional storage-retrieval policies on their respective optimized classes. Our results suggest that if the warehouse utilization is low, different class-formation methods may lead to very different total travel costs, with our approach being the most efficient. We observe the robustness of this result across various parameter settings. A case study based on data from a third-party logistics provider suggests that the robust policy under the FB method outper- forms the other storage-retrieval policies by at least 8% on average, which indicates the potential savings by our approach in practice. One of our findings is that the importance of optimizing classes depends on the warehouse utilization. 2019-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/4541 info:doi/10.1016/j.ejor.2019.03.046 https://ink.library.smu.edu.sg/context/lkcsb_research/article/5540/viewcontent/class.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Logistics Unit-load warehouse Storage-retrieval policy Class-based storage Business Operations and Supply Chain Management |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Logistics Unit-load warehouse Storage-retrieval policy Class-based storage Business Operations and Supply Chain Management |
spellingShingle |
Logistics Unit-load warehouse Storage-retrieval policy Class-based storage Business Operations and Supply Chain Management ANG, Marcus LIM, Yun Fong How to optimize storage classes in a unit-load warehouse |
description |
We study a problem of optimizing storage classes in a unit-load warehouse such that the total travel cost is minimized. This is crucial to the operational efficiency of unit-load warehouses, which constitute a crit- ical part of a supply chain. We propose a novel approach called the FB method to solve the problem. The FB method is suitable for general receiving-dock and shipping-dock locations that may not coincide. The FB method first ranks the locations according to the frequencies that they are visited, which are estimated by a linear program based on the warehouse’s layout as well as the products’ arrivals and demands. The method then sequentially groups the locations into a number of classes that is implementable in prac- tice. After forming the classes, we use a policy based on robust optimization to determine the storage and retrieval decisions. We compare the robust policy with the traditional storage-retrieval policies on their respective optimized classes. Our results suggest that if the warehouse utilization is low, different class-formation methods may lead to very different total travel costs, with our approach being the most efficient. We observe the robustness of this result across various parameter settings. A case study based on data from a third-party logistics provider suggests that the robust policy under the FB method outper- forms the other storage-retrieval policies by at least 8% on average, which indicates the potential savings by our approach in practice. One of our findings is that the importance of optimizing classes depends on the warehouse utilization. |
format |
text |
author |
ANG, Marcus LIM, Yun Fong |
author_facet |
ANG, Marcus LIM, Yun Fong |
author_sort |
ANG, Marcus |
title |
How to optimize storage classes in a unit-load warehouse |
title_short |
How to optimize storage classes in a unit-load warehouse |
title_full |
How to optimize storage classes in a unit-load warehouse |
title_fullStr |
How to optimize storage classes in a unit-load warehouse |
title_full_unstemmed |
How to optimize storage classes in a unit-load warehouse |
title_sort |
how to optimize storage classes in a unit-load warehouse |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2019 |
url |
https://ink.library.smu.edu.sg/lkcsb_research/4541 https://ink.library.smu.edu.sg/context/lkcsb_research/article/5540/viewcontent/class.pdf |
_version_ |
1770572283006418944 |