Summary
The storage location assignment problem (SLAP) is the academic name for a decision every warehouse already makes: which SKU goes in which location. Warehouses call it slotting. Researchers call it SLAP, and they have been studying it since the 1960s.
Nobody solves it fully. The number of possible SKU-to-location combinations grows faster than any solver can work through, so every warehouse runs a rule of thumb instead. Fast movers up front. Heavy cases on the bottom beam. Whatever slot is free.
Those rules have names, and the research says what each one is good at and where it falls over. That is what this article covers.
Goal of storage location assignment
The goal is to make the work that follows from a location assignment as cheap as possible. Picking is where most of that cost sits, commonly estimated at half to three quarters of total warehouse operating cost, most of it labor.
Inside picking, walking dominates. An order picker spends roughly 55 percent of the time traveling, 15 percent searching, 10 percent extracting and 20 percent on paperwork and everything else. Travel is the block that moves when you change where things live, which is why reducing travel distance is usually an assignment question.
8 goals, all pulling against each other
Travel is only the loudest goal. A slot plan is scored against eight, and seven of them can be dialled up or down.
- Short travel. Fast movers near the depot. The cost: those aisles get crowded.
- Low congestion. Fast movers spread across aisles so pickers do not block each other. The cost: longer walks.
- Ergonomics. Fast and heavy items at safe working height. Retrieval runs about 0.3 minutes per item from low racks against roughly two minutes from high racks. The cost: the good heights fill up fast.
- Safe stacking. Sturdy items picked before fragile ones. The cost: the route stops following velocity.
- Fewer mispicks. Look-alike SKUs kept apart. The cost: it splits product families up.
- Grouped families. One short loop per family. The cost: it puts look-alikes side by side.
- Fill rate. Items in bins close to their own size. The cost: the best-fitting bin is rarely at the best picking height.
- Compliance. Hazard classes, weight limits, temperature zones. This one stays fixed. Everything else is optimized around it.
Every goal on that list has a cost, and the cost usually lands on another goal in the same list. Grouped families fights fewer mispicks. Short travel fights low congestion. Fill rate fights ergonomics. No assignment wins on all eight.
What makes the problem hard
The goal is clear enough. What makes it hard is that eight kinds of constraint act on it at once, and each one needs data most warehouses have not checked.
One of these blocks more projects than the rest: missing cube data. Any rule that reasons about space needs verified dimensions per SKU. An item master built up over years holds a mix of measured, estimated and inherited numbers, and the estimated ones look identical to the measured ones in the record.
Checking the file against an item master data standard, or running a warehouse profiling pass, is the cheapest way to find out how much of it is real. The cost of out-of-date dimensional data lands long before anyone attempts a reslot.
The rules warehouses use
Warehouses do not calculate the best assignment. The problem is NP-hard, which means the number of possible SKU-to-location combinations grows faster than any solver can work through them. A state of the art exact method published in 2025 still handles only medium-sized instances, well short of a real building.
So the field uses rules of thumb, which the research calls heuristics: rules that give a good answer fast, with no guarantee it is the best one. The useful question about a rule is not whether it is optimal, but which conditions it assumes, because those are what fail.
Seven rules cover almost everything running in warehouses today. They are sorted here by one question: how tightly a SKU is bound to a location. The first six follow the standard taxonomy of storage policies; scattered storage is the newer arrival, described in 2025 research on piece-level scattered storage.
What the table leaves out
- Cube-per-order index is a ranking rule, not a policy. It sits inside full-turnover, deciding the order SKUs are placed in: space taken divided by pick frequency, lowest ratios closest. It has a real proof for single-command picking, where a picker fetches one item and returns. Outside that case its worst-case behavior is unboundedly bad, and most warehouses do not run single-command picking.
- Shared storage answers a different question. The seven rules sort by how tightly a SKU is bound to a location. Shared storage asks whether one SKU may occupy more than one location at a time, which is a separate axis. The reason to spread a SKU is space recycling: less of it sits in each location, so locations empty sooner and the space returns to the pool. Scattered storage is that idea taken to its limit.
- Golden zone placement is vertical, not horizontal. It reserves waist-to-shoulder height for the fastest movers, so it layers on top of any of the seven rules rather than replacing one.
Which one is best
None of them, universally. A 2025 comparison found dedicated storage better on waiting time and tardiness at large scale, while randomized storage gave lower transportation cost in 11 of 12 large-scale cases in the same study. Same instances, opposite winners, depending on which of the eight goals you are judged on.
One finding does generalize. A 2025 study ran three assignment rules against three routing rules in a working warehouse over five weeks and found the assignment rule mattered more for picking efficiency than the routing rule did, with family grouping delivering an 8 to 12 percent improvement in total picking time. Where things sit beats how pickers are sent around. The operational side of choosing between these is covered where we compare slotting strategies.