This study presents several clustering algorithms for order processing in automated warehousing systems. It is assumed that the orders are handled by an automatic storage and retrieval machine (AS/R machine) which can carry more than one pallet at a time.
These algorithms show how to group the orders that should be picked up for a tour in order to minimize the total distance travelled by the AS/R machine.
Computer programs are developed for the clustering algorithms in which the optimal routing of a tour is found by using a travelling salesman algorithm. Through simulations, the algorithms are compared with those from other studies.
The results are shown substantially better in terms of the distance travelled.