Exact optimization algorithms for an order picking problem
We consider a combinatorial optimization problem arising when a set of pick-up and delivery orders must be satisfied within an Automated Storage/Retrieval System. The computational complexity of the problem is still open, but it is conjectured to be N P -hard. We point out some of its relevant properties a...