Theses on Storage-Location Assignment
The storage-location assignment problem (SLAP) determines which stock-keeping units, product groups, or pallets should occupy which warehouse locations. The cases below show how the decision changes with the warehouse technology, planning horizon, operational constraints, and solution method.
NoteHow to compare the cases
For each thesis, identify what is assigned, what the assignment should improve, which constraints matter, and whether the decision is static, dynamic, or part of a physical reassignment plan.
Thesis cases
| Thesis | How storage-location assignment is used | Setting and method |
|---|---|---|
| Huisman (2023), A standardised layout data model and visualisation tool to showcase the performance of class-based storage policies in warehouses | Assigns products to class-based storage zones and compares the resulting travel distance with the current layout. | Manual warehouse; standardized location data, ABC classification, and visual comparison. |
| Segerink (2023), Improving the overall quality of the warehouse of Siers Installatietechniek | Uses picking frequency and material groups to place frequently requested items closer to favorable locations. | Manual warehouse; ABC analysis, rack redesign, and heatmaps. |
| Veuger (2024), Maximizing the Travel Time Efficiency of the Automated Storage and Retrieval System of Company X | Assigns products to locations in a multi-deep automated storage and retrieval system to reduce shuttle travel time. | AS/RS; dedicated, random, and class-based policies evaluated with optimization, heuristics, and simulation. |
| Lamers (2024), Optimize the Automated Storage and Retrieval System (AS/RS) of Vink Kunststoffen to improve warehouse efficiency | Assigns stock-keeping units and locations to zones while accounting for accessibility and the need to shuffle obstructing loads. | Multi-deep AS/RS; alternative zoning policies and simulated annealing. |
| de Vries (2024), Exploring the Potential of Deep Q Learning on Solving the Dynamic Storage Location Assignment Problem | Treats assignment as a sequential decision in which product locations may change when demand changes. | Dynamic SLAP; mixed-integer modeling, a Markov decision process, and deep Q-learning compared with periodic ABC storage. |
| Langeveld (2024), Adaptive storage location assignment in a heterogeneous fleet unit-load warehouse: A discrete event simulation study | First assigns work to aisles and resources, then assigns each pallet to an exact location while respecting human and automated-vehicle restrictions. | Unit-load warehouse with humans and AGVs; a two-stage adaptive policy evaluated by discrete-event simulation. |
| Bakker (2025), A Tool for Solving the Multi-Period Storage Assignment Location Problem at Mepal with Dynamic Demand Patterns and Divisible First Level Locations | Reassigns products across multiple periods as demand changes, balancing shorter travel against the effort required to move inventory. | Multi-period SLAP; popularity and affinity rules, periodic healing, full rewarehousing, and a hybrid strategy. |
| Keetelaar (2026), Warehouse Layout Optimisation: An Analysis of SKU Placement and Reassignment | Groups frequently co-picked stock-keeping units, places high-frequency groups near input/output, and schedules the subsequent physical relocation over several days. | Warehouse consolidation; correlation-based grouping and simulated annealing under relocation-capacity and zone-availability constraints. |
Comparison prompts
- What is the assignment unit: a stock-keeping unit, product group, pallet, zone, or resource?
- Is the objective travel time, handling cost, space use, relocation effort, or a combination?
- Which physical and operational constraints make the assignment realistic?
- When should a warehouse retain its current assignment, adapt it incrementally, or perform a full reassignment?