Research on Dynamic Storage Location Assignment of Picker-to-Parts Picking Systems under Traversing Routing Method

Xiangbin Xu and Chenhao Ren

Complexity, 2020, vol. 2020, 1-12

Abstract:

Considering time-varying demand of online retail industry, the traditional static storage location assignment is converted into a multistage storage location assignment process based on the idea of gradual and small-step-forward optimization, which can respond to rapid changes in demand by adjusting the storage location of SKUs in the warehouse in real time and dynamically. First, the study formulates the framework dynamic storage location assignment. Then, the adjustment gain model of dynamic storage location assignment is built, and a genetic algorithm is designed to find the final adjustment solution. Finally, the computer program is developed to simulate the whole process. Simulation and data analysis results show that dynamic storage location assignment can effectively improve picking efficiency when the average order size is small and large demand correlation strength. Dynamic storage location assignment simplifies the warehouse operation process by combining the picking operation and storage location assignment into one without changing the picker’s current walking route, which can offer some theoretical guidance for online retail enterprises implementing dynamic storage location assignment.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/1621828.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/1621828.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1621828

DOI: 10.1155/2020/1621828

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().