Large-scale order batching in parallel-aisle picking systems Academic Article uri icon

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. © 2012 Copyright Taylor and Francis Group, LLC.

author list (cited authors)

  • Hong, S., Johnson, A. L., & Peters, B. A.

citation count

  • 35

publication date

  • February 2012