This paper deals with an order picking problem in an automated storage and retrieval system (AS/RS). We present heuristic algorithms for batching a set of orders such that the total distance travelled by the order picking machine is minimized. These algorithms are based on cluster analysis and their efficiency and validity are illustrated through computer simulation. The results show that the algorithms developed perform substantially better than those from previous studies.