Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses

Arjan Dijkstra, Kees Jan Roodbergen

Research output: Contribution to journalArticleAcademicpeer-review

37 Citations (Scopus)
61 Downloads (Pure)

Abstract

Order picking is one of the most time-critical processes in warehouses. We focus on the combined effects
of routing methods and storage location assignment on process performance. We present exact formulas for the average route length under any storage location assignment for four common routing methods.
Properties of optimal solutions are derived that strongly reduce the solution space. Furthermore, we provide a dynamic programming approach that determines storage location assignments, using the route
length formulas and optimality properties. Experiments underline the importance of the introduced procedures by revealing storage assignment patterns that have not been described in literature before.
Original languageEnglish
Pages (from-to)38-59
JournalTransportation Research Part E: Logistics and Transportation Review
Volume102
DOIs
Publication statusPublished - 2017

Keywords

  • Warehouse management
  • Storage assignment
  • Dynamic Programming
  • ORDER PICKING WAREHOUSE
  • RECTANGULAR WAREHOUSE
  • TRAVEL DISTANCE
  • SYSTEMS
  • DESIGN
  • MODEL
  • POLICIES
  • TIME
  • ALLOCATION
  • OPERATION

Cite this