IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v52y2020i6p665-687.html
   My bibliography  Save this article

Optimal order picker routing in the chevron warehouse

Author

Listed:
  • Makusee Masae
  • Christoph H. Glock
  • Panupong Vichitkunakorn

Abstract

Order picking has often been considered as one of the most labor- and time-intensive tasks in warehouse operations. Among the various planning problems that have to be solved in manual picker-to-parts systems, the routing of the order picker usually accounts for the highest share of the total warehouse operating cost. To minimize the cost of order picking, researchers have developed various routing procedures that guide the order picker through the warehouse to complete given customer orders. For some warehouse layouts such as the chevron warehouse, an optimal routing algorithm has not yet been proposed. This article, therefore, contributes to filling this research gap by developing an optimal order picker routing policy for the chevron warehouse. The optimal routing algorithm proposed in this article is based on the concept of graph theory and utilizes a dynamic programming procedure. In addition, we propose various simple routing heuristics for the chevron warehouse. In computational experiments, the average order picking tour lengths resulting from optimal routing and from the simple heuristics are compared. Moreover, we compare the performance of the chevron warehouse to the conventional two-block warehouse under various conditions using the tour lengths obtained by the optimal algorithms.

Suggested Citation

  • Makusee Masae & Christoph H. Glock & Panupong Vichitkunakorn, 2020. "Optimal order picker routing in the chevron warehouse," IISE Transactions, Taylor & Francis Journals, vol. 52(6), pages 665-687, June.
    • Handle: RePEc:taf:uiiexx:v:52:y:2020:i:6:p:665-687
    DOI: 10.1080/24725854.2019.1660833
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2019.1660833
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2019.1660833?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li Zhou & Huwei Liu & Junhui Zhao & Fan Wang & Jianglong Yang, 2022. "Performance Analysis of Picking Routing Strategies in the Leaf Layout Warehouse," Mathematics, MDPI, vol. 10(17), pages 1-28, September.
    2. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    3. Mustapha Haouassi & Yannick Kergosien & Jorge E. Mendoza & Louis-Martin Rousseau, 2022. "The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 614-645, September.
    4. Laura Korbacher & Katrin Heßler & Stefan Irnich, 2023. "The Single Picker Routing Problem with Scattered Storage: Modeling and Evaluation of Routing and Storage Policies," Working Papers 2302, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Rubio, Francisco & Llopis-Albert, Carlos & Valero, Francisco, 2021. "Multi-objective optimization of costs and energy efficiency associated with autonomous industrial processes for sustainable growth," Technological Forecasting and Social Change, Elsevier, vol. 173(C).
    6. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    7. Shandong Mou, 2022. "Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores," Mathematics, MDPI, vol. 10(9), pages 1-19, April.
    8. Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
    9. Zhang, Jiayuan & Yalcin, Mehmet G. & Hales, Douglas N., 2021. "Elements of paradoxes in supply chain management literature: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 232(C).
    10. Maria A. M. Trindade & Paulo S. A. Sousa & Maria R. A. Moreira, 2022. "Ramping up a heuristic procedure for storage location assignment problem with precedence constraints," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 646-669, September.
    11. Jose Alejandro Cano & Pablo Cortés & Jesús Muñuzuri & Alexander Correa-Espinal, 2023. "Solving the picker routing problem in multi-block high-level storage systems using metaheuristics," Flexible Services and Manufacturing Journal, Springer, vol. 35(2), pages 376-415, June.

    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:taf:uiiexx:v:52:y:2020:i:6:p:665-687. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.