DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE
- 1 July 1993
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 25 (4), 76-87
- https://doi.org/10.1080/07408179308964306
Abstract
This paper evaluates and compares strategies for routing a manual picker through a simple warehouse. It expands on previous work, in which optimization algorithms were developed, by deriving equations which relate route length to warehouse attributes. Several rules of thumb are derived for selection of order picking strategies and optimization of warehouse shape.Keywords
This publication has 12 references indexed in Scilit:
- Order batching algorithms and travel-time estimation for automated storage/retrieval systemsInternational Journal of Production Research, 1989
- An efficient algorithm to cluster order picking items in a wide aisleEngineering Costs and Production Economics, 1988
- The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an ApplicationTransportation Science, 1984
- 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
- Algorithms for optimal material handling in automatic warehousing systemsInternational Journal of Production Research, 1981
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospectsNetworks, 1981
- An Asymptotic, Probabilistic Analysis of a Routing ProblemMathematics of Operations Research, 1978
- Expected Distances in Distribution ProblemsJournal of the Operational Research Society, 1969
- ELEMENTS OF WAREHOUSE LAYOUTInternational Journal of Production Research, 1968