DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE
IIE TransactionsPublished 1 July 1993
Randolph W. Hall
Citations317
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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
Computer ScienceEngineering
The Traveling Salesman Problem
1,622 Citations2019Lawrence Snyder, Zuo‐Jun Max Shen
Lecture notes in economics and mathematical systemsTraveling Salesman Problem
800 Citations1986H. T. Lau
The traveling salesman problem is to start from a node in G, visit every other node exactly once and return back to the starting node in such a way that the total traveled distance is minimum.
Operations ResearchOrder-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
622 Citations1983H. Donald Ratliff, Arnon Rosenthal
This paper addresses the problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles by presenting an algorithm for picking an order in minimum time.
IIE TransactionsTravel-Time Models for Automated Storage/Retrieval Systems
460 Citations1984Yavuz A. Bozer, John A. White
Travel-time models are developed for automated storage/retrieval (AS/R) machines that travel simultaneously horizontally and vertically as it moves along a storage aisle for randomized storage conditions.
Transportation ScienceThe Distance Traveled to Visit <i>N</i> Points with a Maximum of <i>C</i> Stops per Vehicle: An Analytic Model and an Application
298 Citations1984Carlos F. Daganzo
A simple formula to predict the distance traveled by fleets of vehicles in physical distribution problems involving a depot and its area of influence is developed.
Transportation Research Part B MethodologicalThe length of tours in zones of different shapes
263 Citations1984Carlos F. Daganzo
A simple strategy that yields good traveling salesman tours is presented, and the resulting tours are suboptimal but appear to be close to those that can be obtained by hand.
IIE TransactionsOn Sequencing Retrievals In An Automated Storage/Retrieval System
204 Citations1987Min‐Hong Han, Leon F. McGinnis +2 more
A “nearest-neighbor” sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation.
NetworksCombinatorial optimization and vehicle fleet planning: Perspectives and prospects
161 Citations1981Thomas L. Magnanti
This discussion shows that prospects for applying exact methods, possibly in conjunction with heuristics, are far from fully realized and points to vehicle fleet planning as a tempting target of opportunity for further investigation.
A I I E TransactionsInternal Layout Design of a Warehouse
126 Citations1980Yoseph Bassan, Yaakov Roll +1 more
International Journal of Production ResearchAlgorithms for optimal material handling in automatic warehousing systems
124 Citations1981Elsayed A. Elsayed
Four heuristic algorithms for handling orders in automatic warehousing systems are presented and optimal tours are found by using the travelling salesman algorithm.
IIE TransactionsOrder Picking In An Aisle
121 Citations1988Marc Goetschalckx, H. Donald Ratliff
An efficient optimal algorithm is developed and shown to yield policies with up to 30% savings in travel time over commonly used policies and to pick both sides of the aisle in the same pass.
Mathematics of Operations ResearchAn Asymptotic, Probabilistic Analysis of a Routing Problem
120 Citations1978David M. Stein
It is shown that the length of the tour required by a single bus to pick up and deliver n passengers from random locations to random destinations in a bounded region of the plane converges almost surely to the square root of slightly more than twice the area of the region as n goes to infinity.
Journal of the Operational Research SocietyExpected Distances in Distribution Problems
113 Citations1969Nicos Christofides, Samuel Eilon
In many problems in distribution management it is necessary to take account of the expected distances that result from dispatching vehicles to meet customer demand, and the sum of radial distances is used as a measure of the delivery "costs".
International Journal of Production ResearchOrder batching algorithms and travel-time estimation for automated storage/retrieval systems
98 Citations1989Elsayed A. Elsayed, Ozhan Unal
Four heuristics are developed for the order batching problem, based on the time-saving criterion of combining two or more orders in a single tour rather than processing them one order at a time.
International Journal of Production ResearchComputerized algorithms for order processing in automated warehousing systems
90 Citations1983Elsayed A. Elsayed, Richard G. Stern
New algorithms for processing a set of orders in automated warehousing systems are presented and the travelling salesman algorithm is utilized to determine the optimal distance travelled within the warehouse for every group of orders.