Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/46369
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorRamaekers, Katrien-
dc.contributor.authorBAHADORNIA, Mostafa-
dc.contributor.authorRAMAEKERS, Katrien-
dc.contributor.authorBRAEKERS, Kris-
dc.contributor.authorCornelissen, Trijntje-
dc.contributor.authorD'HAEN, Ruben-
dc.date.accessioned2025-07-22T13:34:59Z-
dc.date.available2025-07-22T13:34:59Z-
dc.date.issued2025-
dc.date.submitted2025-07-03T10:38:22Z-
dc.identifier.citation34th European Conference on Operational Research (EURO 2025), University of Leeds, UK, 2025, June 22- 25-
dc.identifier.urihttp://hdl.handle.net/1942/46369-
dc.description.abstractThe rapid growth of online retailing necessitates flexible warehouse management strategies to adapt to this evolving landscape. One of the critical challenges in this area is to reduce the order-picking travel distance. This travel distance is highly affected by the Storage Location Assignment (SLA) decision, which determines how products are allocated to locations in the warehouse. Prevalent SLA strategies are turnover-based assignment, correlated storage assignment, and scattered storage assignment. This study proposes a mixed SLA approach that adopts each prevalent SLA strategy to some degree, tailored to the customer order pattern. To this end, three analytical measures are defined to assess the degree of realization of each SLA strategy. To address the dynamic nature of business needs, a data-driven approach is introduced to calculate the weight of each measure using customer order data. Next, a novel multi-dimensional mathematical model for SLA optimization is proposed. This model incorporates the weighted measures and operational constraints. As the primary goal of SLA optimization is to reduce the order-picking travel distance, the proposed model is tested in a collaborative human-robot order-picking configuration in a mixed-shelves layout. Finally, results indicate that the proposed model provides better storage assignments than when focusing on classical strategies individually.-
dc.language.isoen-
dc.subject.otherWarehouse Planning-
dc.subject.otherLogistics-
dc.subject.otherMathematical Programming-
dc.titleBalancing Storage Location Assignment Strategies in Warehouses: A Data-Driven Approach-
dc.typeConference Material-
local.bibliographicCitation.conferencedate2025, June 22- 25-
local.bibliographicCitation.conferencename34th European Conference on Operational Research (EURO 2025)-
local.bibliographicCitation.conferenceplaceUniversity of Leeds, UK-
local.bibliographicCitation.jcatC2-
local.contributor.corpauthorRuben D'Haen-
local.type.refereedNon-Refereed-
local.type.specifiedConference Material - Abstract-
local.type.programmeVSC-
local.uhasselt.internationalno-
item.fullcitationBAHADORNIA, Mostafa; RAMAEKERS, Katrien; BRAEKERS, Kris; Cornelissen, Trijntje & D'HAEN, Ruben (2025) Balancing Storage Location Assignment Strategies in Warehouses: A Data-Driven Approach. In: 34th European Conference on Operational Research (EURO 2025), University of Leeds, UK, 2025, June 22- 25.-
item.contributorBAHADORNIA, Mostafa-
item.contributorRAMAEKERS, Katrien-
item.contributorBRAEKERS, Kris-
item.contributorCornelissen, Trijntje-
item.contributorD'HAEN, Ruben-
item.accessRightsClosed Access-
item.fulltextNo Fulltext-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.