EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

2364. A Flexible Procedure for the Single Picker Routing Problem With Scattered Storage

Invited abstract in session MA-64: Routing in Warehouses, stream VeRoLog - Vehicle Routing and Logistics.

Monday, 8:30-10:00
Room: S16 (building: 101)

Authors (first author is the speaker)

1. Felix Weidinger
Technical University of Darmstadt
2. Constantin Wildt
Technical University of Darmstadt

Abstract

E-commerce retailers have substantially reinvented warehousing. To pick small, heterogeneous orders in a short period of time, novel warehousing approaches have been developed. The equivalent of classical manual warehousing is, hereby, mixed-shelf storage; where pieces of the same SKU can be found at many storage positions. This, however, makes the picker routing problem, which aims to find a shortest picking tour for collecting all items on the current pick-list, a combined selection and sequencing problem. The storage positions to be visited must be selected, and a tour through the selected positions must be planned. The resulting problem, often referred to as the Single Picker Routing Problem with Scattered Storage (SPRP-SS), has gained much attention recently. Most of the proposed procedures, however, assume a rectangular layout of warehouses, such that the subproblem, once the positions to be visited are selected, is solvable in polynomial time. However, for warehouses in existing dense inner-city buildings or multi-level mezzanine systems, the property of rectangular layouts is not met. In the talk, an exact and heuristic solution approach for solving the SPRP-SS for arbitrary distance matrices is presented and discussed.

Keywords

Status: accepted

Back to the list of papers