KIT | KIT-Bibliothek | Impressum | Datenschutz

The backroom assignment problem for in-store order fulfillment

Koehler, Sebastian 1; Theilacker, Felicia 1
1 Karlsruher Institut für Technologie (KIT)

Abstract:

Efficient in-store fulfillment is essential for today’s omnichannel services, as retailers are taking on tasks previously performed by customers themselves while shopping. This paper introduces a novel backroom assignment problem for omnichannel stores, aiming to optimize the allocation of articles to a forward pick area exclusively dedicated to online demand. We present both random and dedicated storage policy formulations for the backroom assignment problem (BAP), determining the allocation of articles, their quantities to the forward pick area, and the selection of storage units. To achieve a balance between computational efficiency and solution quality, we introduce two decomposition methods. We evaluate the impact of our proposed BAP formulations using real data from a drug store chain and quantify the effects of an increasing online demand ratio and different forward pick area sizes on the in-store logistical effort. Results from a three-store use case demonstrate that backroom assignments can substantially reduce in-store logistical effort compared to a scenario without backroom usage, especially as demand shifts increasingly towards the online channel. ... mehr

Zugehörige Institution(en) am KIT Institut für Fördertechnik und Logistiksysteme (IFL)
Publikationstyp Zeitschriftenaufsatz
Publikationsmonat/-jahr 04.2025
Sprache Englisch
Identifikator ISSN: 0360-8352, 1879-0550
KITopen-ID: 1000179920
Erschienen in Computers and Industrial Engineering
Verlag Elsevier
Band 202
Seiten Art.-Nr.: 110912
Vorab online veröffentlicht am 01.02.2025
Nachgewiesen in Scopus
Web of Science
OpenAlex
Dimensions

Verlagsausgabe §
DOI: 10.5445/IR/1000179920
Veröffentlicht am 14.03.2025
Seitenaufrufe: 1
seit 14.03.2025
Cover der Publikation
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page