IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1621828.html
   My bibliography  Save this article

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

Author

Listed:
  • Xiangbin Xu
  • Chenhao Ren

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.

Suggested Citation

  • Xiangbin Xu & Chenhao Ren, 2020. "Research on Dynamic Storage Location Assignment of Picker-to-Parts Picking Systems under Traversing Routing Method," Complexity, Hindawi, vol. 2020, pages 1-12, November.
    • Handle: RePEc:hin:complx:1621828
    DOI: 10.1155/2020/1621828
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/1621828.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2020/1621828.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/1621828?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:1621828. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.