A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout

  • Sebastian Henn
  • André Scholz
  • Meike Stuhlmann
  • Gerhard Wäscher
Schlagworte: Order Picking, Picker Routing, Traveling Salesman Problem

Abstract

The Single-Picker Routing Problem deals with the determination of sequences according to which items have to be picked in a distribution warehouse and the identification of the corresponding paths which have to be travelled by human operators (order pickers). The Single-Picker Routing Problem represents a special case of the classic Traveling Salesman Problem (TSP) and, therefore, can also be modeled as a TSP. However, the picking area of a warehouse typically possesses a block layout, i.e. the items are located in parallel picking aisles, and the order pickers can only change over to another picking aisle at certain positions by means of so-called cross aisles. In this paper, for the first time a mathematical programming formulation is proposed which takes into account this specific property. Based on extensive numerical experiments, it is shown that the proposed formulation is superior to standard TSP formulations.

Veröffentlicht
2018-09-04
Ausgabe
Rubrik
Artikel