MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem
We consider the Order Batching Problem (OBP). We propose MILP formulations for three OBP variants. We suggest an efficient local search procedure. We report computational experiments on randomly generated instances.
local search order batching problem warehouse management mixed integer linear programming