A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems

This study focuses on the problem of sequencing requests for an end-of-aisle automated storage and retrieval system in which each retrieved load must be returned to its earlier storage location after a worker has picked some products from the load. At the picking station, a buffer is maintained to absorb any fluctuations in speed between the worker and the storage/retrieval machine. We show that, under conditions, the problem of optimally sequencing the requests in this system with a buffer size of m loads forms a special case of the multiple traveling salesmen problem in which each salesman visits the same number of cities. Several interesting structural properties for the problem are mathematically shown. In addition, a branch-and-cut method and heuristics are proposed. Experimental results show that the proposed simulated annealing-based heuristic performs well in all circumstances and significantly outperforms benchmark heuristics. For instances with negligible picking times for the worker, we show that this heuristic provides solutions that are, on average, within 1.8% from the optimal value.

Automated summary

This study focused on the problem of sequencing requests for a specific type of automated storage and retrieval system, proposing an effective heuristic method and demonstrating its superior performance. Experimental results showed that, under certain conditions, the solutions provided by this heuristic method were close to the optimal value.