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

Large-scale order batching in parallel-aisle picking systems

Author

Listed:
  • Soondo Hong
  • Andrew Johnson
  • Brett Peters

Abstract

This article discusses an order batching formulation and heuristic solution procedure suitable for a large-scale order picking situation in parallel-aisle picking systems. Order batching can decrease the total travel distance of pickers not only through reducing the number of trips but also by shortening the length of each trip. In practice, some order picking systems retrieve 500–2000 orders per hour and include ten or more aisles. The proposed heuristic produces near-optimal solutions with run times of roughly 70 s in a ten-aisle system. The quality of the solutions is demonstrated by comparing with a lower bound developed as a linear programming relaxation of the batching formulation developed in this article. A simulation study indicates that the proposed heuristic outperforms existing methods described in the literature or used in practice. In addition, the resulting order picking operations are relatively robust to picker blocking.

Suggested Citation

  • Soondo Hong & Andrew Johnson & Brett Peters, 2012. "Large-scale order batching in parallel-aisle picking systems," IISE Transactions, Taylor & Francis Journals, vol. 44(2), pages 88-106.
    • Handle: RePEc:taf:uiiexx:v:44:y:2012:i:2:p:88-106
    DOI: 10.1080/0740817X.2011.588994
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2011.588994
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2011.588994?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. Pan, Jason Chao-Hsien & Shih, Po-Hsun & Wu, Ming-Hung, 2015. "Order batching in a pick-and-pass warehousing system with group genetic algorithm," Omega, Elsevier, vol. 57(PB), pages 238-248.
    2. Minfang Huang & Qiong Guo & Jing Liu & Xiaoxu Huang, 2018. "Mixed Model Assembly Line Scheduling Approach to Order Picking Problem in Online Supermarkets," Sustainability, MDPI, vol. 10(11), pages 1-16, October.
    3. Çağla Cergibozan & A. Serdar Tasan, 2019. "Order batching operations: an overview of classification, solution techniques, and future research," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 335-349, January.
    4. Matusiak, Marek & de Koster, René & Kroon, Leo & Saarinen, Jari, 2014. "A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse," European Journal of Operational Research, Elsevier, vol. 236(3), pages 968-977.
    5. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
    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. Hong, Soondo & Johnson, Andrew L. & Peters, Brett A., 2012. "Batch picking in narrow-aisle order picking systems with consideration for picker blocking," European Journal of Operational Research, Elsevier, vol. 221(3), pages 557-570.
    8. Mowrey, Corinne H. & Parikh, Pratik J., 2014. "Mixed-width aisle configurations for order picking in distribution centers," European Journal of Operational Research, Elsevier, vol. 232(1), pages 87-97.
    9. Heiko Diefenbach & Simon Emde & Christoph H. Glock & Eric H. Grosse, 2022. "New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 535-573, June.
    10. Hong, Soondo & Johnson, Andrew L. & Peters, Brett A., 2015. "Quantifying picker blocking in a bucket brigade order picking system," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 862-873.
    11. Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.
    12. Ardjmand, Ehsan & Shakeri, Heman & Singh, Manjeet & Sanei Bajgiran, Omid, 2018. "Minimizing order picking makespan with multiple pickers in a wave picking warehouse," International Journal of Production Economics, Elsevier, vol. 206(C), pages 169-183.
    13. Hong, Soondo, 2014. "Two-worker blocking congestion model with walk speed m in a no-passing circular passage system," European Journal of Operational Research, Elsevier, vol. 235(3), pages 687-696.
    14. van Gils, Teun & Ramaekers, Katrien & Caris, An & de Koster, René B.M., 2018. "Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review," European Journal of Operational Research, Elsevier, vol. 267(1), pages 1-15.
    15. Hong, Soondo & Kim, Youngjoo, 2017. "A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system," European Journal of Operational Research, Elsevier, vol. 257(1), pages 185-196.

    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:44:y:2012:i:2:p:88-106. 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.