Clustering algorithms for order picking in an automated storage and retrieval system
- 1 February 1988
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 26 (2) , 189-201
- https://doi.org/10.1080/00207548808947853
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Computerized algorithms for order processing in automated warehousing systemsInternational Journal of Production Research, 1983
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1983
- The traveling salesman problem: An update of researchNaval Research Logistics Quarterly, 1983
- Algorithms for optimal material handling in automatic warehousing systemsInternational Journal of Production Research, 1981
- Optimal Batching in a Semi-Automated Order Picking SystemJournal of the Operational Research Society, 1979