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

Optimal class boundaries, number of aisles, and pick list size for low-level order picking systems

Author

Listed:
  • Subir Rao
  • Gajendra Adil

Abstract

This article considers a two-block warehouse with low-level aisles having dedicated pickers who follow a return routing policy within the aisle. Travel distance models are formulated assuming a given product density distribution in aisles for multi-item picks. An analytical recursive procedure is developed to find optimal n-class partitions of each warehouse aisle. A range on the number of classes and number of picks for which class-based storage is an attractive option over the random storage policy is determined through a computational study. The article also presents an iterative hierarchical framework to simultaneously obtain pick list size, number of aisles, and class storage boundaries. A sensitivity analysis of optimal pick travel distance against important warehouse design parameters is presented.

Suggested Citation

  • Subir Rao & Gajendra Adil, 2013. "Optimal class boundaries, number of aisles, and pick list size for low-level order picking systems," IISE Transactions, Taylor & Francis Journals, vol. 45(12), pages 1309-1321.
    • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:12:p:1309-1321
    DOI: 10.1080/0740817X.2013.772691
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.772691
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2013.772691?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. Dong, Wenquan & Jin, Mingzhou, 2024. "Automated storage and retrieval system design with variant lane depths," European Journal of Operational Research, Elsevier, vol. 314(2), pages 630-646.
    2. Manzini, Riccardo & Accorsi, Riccardo & Gamberi, Mauro & Penazzi, Stefano, 2015. "Modeling class-based storage assignment over life cycle picking patterns," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 790-800.
    3. Dijkstra, Arjan S. & Roodbergen, Kees Jan, 2017. "Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 102(C), pages 38-59.
    4. De Santis, Roberta & Montanari, Roberto & Vignali, Giuseppe & Bottani, Eleonora, 2018. "An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses," European Journal of Operational Research, Elsevier, vol. 267(1), pages 120-137.
    5. Silva, Allyson & Roodbergen, Kees Jan & Coelho, Leandro C. & Darvish, Maryam, 2022. "Estimating optimal ABC zone sizes in manual warehouses," International Journal of Production Economics, Elsevier, vol. 252(C).
    6. Rao, Subir S. & Adil, Gajendra K. & Venkitasubramony, Rakesh, 2020. "On the expectation of the largest gap in a warehouse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    7. Subir S. Rao & Gajendra K. Adil, 2017. "Analytical models for a new turnover-based hybrid storage policy in unit-load warehouses," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 327-346, January.
    8. Guo, Xiaolong & Chen, Ran & Du, Shaofu & Yu, Yugang, 2021. "Storage assignment for newly arrived items in forward picking areas with limited open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).

    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:45:y:2013:i:12:p:1309-1321. 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.