Previous studies on sequence optimisation for order picking batches compared basically the available routing
heuristics with the minimum travel time routing, to select the best working routing heuristics. For those cases where
routing heuristics could hardly be applied, this paper looks into the potential of using mathematical optimisation
routines to solve the sequencing problem in order picking batches. The results are directly presented in relation to acase study from practice – this is considered to be a typical case of practical constraints in warehouse layout that
makes the application of routing heuristics difficult.