Order sequencing on a unidirectional cyclical picking line
We model a unidirectional order picking system to minimise travel distance. A concept of a cut is introduced to obtain a tight lower bound. This lower bound may be transformed into a feasible solution to the problem. This approach yields solutions that are at most one pick cycle off an optimal. It significantly outperforms adaptations of existing heuristics.
sequencing distribution order-picking combinatorial optimization unidirectional carousel