IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v143y2020ics1366554520307511.html
   My bibliography  Save this article

On the expectation of the largest gap in a warehouse

Author

Listed:
  • Rao, Subir S.
  • Adil, Gajendra K.
  • Venkitasubramony, Rakesh

Abstract

The expectation of the largest gap between two consecutive picks in an aisle is a basic building block in modelling the pick travel distance for the largest gap routing policy in a warehouse. Researchers have predominantly used either simulation or recursive algorithms for its estimation. This paper develops analytical expressions for this statistic in, both, continuous and discrete aisles using the statistical theory of ordered uniform spacings. We further demonstrate how these results can apply to the entire multi-aisle warehouse. Our results show that these expressions are accurate and extremely fast to evaluate as compared to the existing approaches.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:transe:v:143:y:2020:i:c:s1366554520307511
    DOI: 10.1016/j.tre.2020.102103
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554520307511
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.102103?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.

    References listed on IDEAS

    as
    1. 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.
    2. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    3. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    4. Donald D. Eisenstein, 2008. "Analysis and optimal design of discrete order picking technologies along a line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 350-362, June.
    5. 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.
    6. H. Donald Ratliff & Arnon S. Rosenthal, 1983. "Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 31(3), pages 507-521, June.
    7. Gu, Jinxiang & Goetschalckx, Marc & McGinnis, Leon F., 2010. "Research on warehouse design and performance evaluation: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 203(3), pages 539-549, June.
    8. Ismihan Bairamov & Alexandre Berred & Alexei Stepanov, 2010. "Limit results for ordered uniform spacings," Statistical Papers, Springer, vol. 51(1), pages 227-240, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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).
    2. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    3. 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).
    4. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    5. Jiang, Min & Leung, K.H. & Lyu, Zhongyuan & Huang, George Q., 2020. "Picking-replenishment synchronization for robotic forward-reserve warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    6. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    7. 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.
    8. Ç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.
    9. Giannikas, Vaggelis & Lu, Wenrong & Robertson, Brian & McFarlane, Duncan, 2017. "An interventionist strategy for warehouse order picking: Evidence from two case studies," International Journal of Production Economics, Elsevier, vol. 189(C), pages 63-76.
    10. Fangyu Chen & Hongwei Wang & Yong Xie & Chao Qi, 2016. "An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 389-408, April.
    11. Lu, Wenrong & McFarlane, Duncan & Giannikas, Vaggelis & Zhang, Quan, 2016. "An algorithm for dynamic order-picking in warehouse operations," European Journal of Operational Research, Elsevier, vol. 248(1), pages 107-122.
    12. 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.
    13. Vichitkunakorn, Panupong & Emde, Simon & Masae, Makusee & Glock, Christoph H. & Grosse, Eric H., 2024. "Locating charging stations and routing drones for efficient automated stocktaking," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1129-1145.
    14. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    15. Weidinger, Felix & Boysen, Nils & Schneider, Michael, 2019. "Picker routing in the mixed-shelves warehouses of e-commerce retailers," European Journal of Operational Research, Elsevier, vol. 274(2), pages 501-515.
    16. Krzysztof Dmytrow, 2020. "Impact of the Method of Criteria Normalisation on the Order Picking Route and Time," European Research Studies Journal, European Research Studies Journal, vol. 0(4), pages 834-851.
    17. Saylam, Serhat & Çelik, Melih & Süral, Haldun, 2024. "Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses," European Journal of Operational Research, Elsevier, vol. 313(1), pages 225-240.
    18. 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.
    19. Boysen, Nils & de Koster, René & Füßler, David, 2021. "The forgotten sons: Warehousing systems for brick-and-mortar retail chains," European Journal of Operational Research, Elsevier, vol. 288(2), pages 361-381.
    20. Sergio Gil-Borrás & Eduardo G. Pardo & Antonio Alonso-Ayuso & Abraham Duarte, 2020. "GRASP with Variable Neighborhood Descent for the online order batching problem," Journal of Global Optimization, Springer, vol. 78(2), pages 295-325, October.

    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:eee:transe:v:143:y:2020:i:c:s1366554520307511. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.