This paper presents four heuristic algorithms for handling orders in automatic warehousing systems. It is assumed that the orders will be handled by the use of an automatic storage and retrieval machine (S/R machine). The algorithms select, the orders that will be hand led in one tour in order to minimize the total distance travelled by the S7sol;R machine within the warehouse system. Computer programs are developed for the four algorithms and the optimal tours are found by using the travelling salesman algorithm. Optimal or near optimal solutions for the handling problem are found.