Partitioning of the orders among th

Partitioning of the orders among the pickers is a variation of the classical
vehicle routing problem(VRP), in which ‘‘stops’’ are assigned to routes
and the objective is to minimize the total route distance or time. However, in the order-batching problem,assigning an order to a picker’s route implies that all the picking locations for the SKUs in thisorder are assigned to this route. This is similar to the pick-up and delivery vehicle routing problem, or the dial-a-ride problem, where a service request consists of a pick-up location and a drop-off location with
time precedence. In the order partitioning problem, there may be many stops (SKUs) associated with a single service request