A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
We solve the combined precedence-constrained routing and batching problem. Our method compares very well to heuristics from literature and optimal solutions. We save 5000kilometers in travel distance in our sample warehouse over a 3month period. The method is general and not constrained by the warehouse layout. A? is used for the routing, and simulated annealing for batching.
batching heuristics logistics order picking precedence