A special case of the multiple Traveling Salesmen Problem in end-of-aisle picking systems

Lennart Baardman, K.J. Roodbergen, Hector Carlo, Albert Schrotenboer

Onderzoeksoutput: ArticleAcademicpeer review

12 Downloads (Pure)


This study focuses on the problem of sequencing requests for an end-of-aisle automated storage and retrieval system (AS/RS), where 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 (mTSP) where 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.
Originele taal-2English
TijdschriftTransportation Science
StatusAccepted/In press - 2021

Citeer dit