Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

H. Donald Ratliff and Arnon S. Rosenthal
Additional contact information
H. Donald Ratliff: Georgia Institute of Technology, Atlanta, Georgia
Arnon S. Rosenthal: Sperry Research, Sudbury, Massachusetts

Operations Research, 1983, vol. 31, issue 3, 507-521

Abstract: This paper addresses the problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles. An algorithm is presented for picking an order in minimum time. The computational effort required is linear in the number of aisles. The procedure has been implemented on a microcomputer A 50-aisle problem requires only about 1 minute to solve.

Keywords: 491 a solvable traveling salesman problem; 587 warehouse order-picking (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (104)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.3.507 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:31:y:1983:i:3:p:507-521

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().