An Efficient Algorithm to Cluster Order Picking Items in a Wide Aisle,

Abstract

In many warehousing systems cases of items have to be retrieved manually from both sides of a wide aisle and deposited on a vehicle which travels on the center line of the aisle. The picker will stop the vehicle, pick and load cases of items onto the vehicle and then drive to the next stop. There is a tradeoff between the time to stop and start the vehicle and the increased walking distance if fewer vehicle stops are made. An algorithm is presented to optimally determine the number and location of stops and to specify the items to be picked at each stop. Comparison with heuristic clustering methods indicates savings of 10% to 90%. The algorithm can be implemented in real time on a microcomputer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1986
Accession Number
ADA174060

Entities

People

  • H. D. Ratliff
  • Marc Goetschalckx

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Coverings
  • Dynamic Programming
  • Engineering
  • Experimental Design
  • Factorial Design
  • Floating Point Operations
  • Industrial Engineering
  • Military Research
  • New Jersey
  • Personal Computers
  • Scheduling (Production)
  • Systems Engineering
  • Travel Time

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Logistics and Supply Chain Management.
  • Regression Analysis.