Order batching using an approximation for the distance travelled by pickers
Cristiano Arbex Valle, John E Beasley

TL;DR
This paper proposes a novel order batching approach for warehouse pickers that uses a distance approximation to optimize batching decisions, improving efficiency in online grocery shopping scenarios.
Contribution
It introduces a new formulation for order batching based on a distance approximation, extending it for multi-block warehouses and providing a heuristic algorithm.
Findings
Effective batching for up to 75 orders demonstrated
Improved approximation for multi-block warehouse configurations
Heuristic algorithm enhances computational efficiency
Abstract
In this paper we investigate the problem of order batching for picker routing. Our approach is applicable to warehouses (storage areas) arranged in the standard rectangular grid layout, so with parallel aisles and two or more cross-aisles. The motivation underlying our work is online grocery shopping in which orders may be composed of dozens of items. The approach presented directly addresses order batching, but uses a distance approximation to influence the batching of orders without directly addressing the routing problem. We present a basic formulation based on deciding the orders to be batched together so as to optimise an objective that approximates the picker routing distance travelled. We extend our formulation by improving the approximation for cases where we have more than one block in the warehouse. We present constraints to remove symmetry in order to lessen the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
