{"id":3298,"date":"2026-11-20T14:00:00","date_gmt":"2026-11-20T13:00:00","guid":{"rendered":"https:\/\/blog.3dbinpacking.com\/?p=3298"},"modified":"2026-11-20T12:31:14","modified_gmt":"2026-11-20T11:31:14","slug":"mixed-sku-pallet-building-algorithms","status":"publish","type":"post","link":"https:\/\/blog.3dbinpacking.com\/en\/mixed-sku-pallet-building-algorithms\/","title":{"rendered":"Mixed-SKU Pallet Building Algorithms: How Palletization Software Works"},"content":{"rendered":"\n\n
\n \n
\n \n
\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n <\/div>\n \n
\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n <\/div>\n<\/div>\n \n\n
\n Rate this post<\/span>\n <\/div>\n <\/div>\n\n

The 3D bin packing problem behind mixed pallets, the algorithm families that solve it, and the constraints that decide whether a pallet arrives intact.<\/em><\/p>\n\n\n\n

Mixed-SKU pallet building means stacking cartons of different sizes, weights and handling rules onto one stable pallet. Palletization software treats the pallet as a three-dimensional bin packing problem: it searches for positions and orientations that keep every carton inside the pallet’s footprint and height limit, respect weight and stacking rules, and use as much space as possible. The problem is strongly NP-hard, so real systems rely on heuristics instead of checking every option.<\/p>\n\n\n\n

NP-hard<\/strong>
STRONGLY: THE 3D BIN PACKING PROBLEM BEHIND MIXED PALLETS (MARTELLO, PISINGER & VIGO, 2000)<\/td>
2.4 \u00d7 10\u00b9\u2078<\/strong>
WAYS TO ORDER JUST 20 CARTONS, BEFORE COUNTING ROTATIONS AND POSITIONS<\/td>
25%<\/strong>
AVERAGE COMPRESSION STRENGTH LOST BY EMPTY BOXES STACKED THREE HIGH ON A PALLET IN LAB TESTS (CAL POLY \/ MSU)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Single-SKU vs. Mixed-SKU Palletization: Why Complexity Explodes<\/strong><\/strong><\/h2>\n\n\n\n

A single-SKU pallet is a solved problem. When every carton has the same dimensions and weight, the pallet follows a fixed pattern, such as block, brick or pinwheel, that can be taken from a pattern chart and repeated layer after layer.<\/p>\n\n\n\n

Mixed-SKU pallets are a different job. Distribution centers, retail replenishment and 3PL operations build pallets from dozens of cartons that differ in size, weight, permitted orientation and fragility. There is no chart for that, and every order is a new puzzle.<\/p>\n\n\n\n

Why brute force fails<\/strong>
Take a standard footprint such as the 1200 \u00d7 800 mm EUR pallet or the 48 \u00d7 40 in GMA pallet common in North America. The order in which 20 different cartons are placed can alone be chosen in 20! \u2248 2.4 \u00d7 10\u00b9\u2078 ways, and each carton can also be rotated and moved to many positions. Checking every combination is out of the question for a system that has to answer while a packer waits.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

The Mathematical Foundation: The 3D Bin Packing Problem<\/strong><\/strong><\/h2>\n\n\n\n

Mixed-SKU pallet loading is a practical variant of the three-dimensional bin packing problem (3D-BPP): rectangular items have to be packed orthogonally into the smallest number of rectangular bins, without overlapping and without crossing the bin’s walls. Martello, Pisinger and Vigo describe it as strongly NP-hard and \u201cextremely difficult to solve in practice\u201d (Operations Research, 2000<\/u><\/a>). In plain terms, no known method guarantees the best layout quickly for large orders, which is why commercial software uses heuristics that find very good layouts in a fraction of the time.<\/p>\n\n\n\n

Physical and Operational Constraints in Palletization<\/strong><\/strong><\/h3>\n\n\n\n

Textbook 3D-BPP only asks whether the boxes fit. A real pallet also has to survive a forklift, a truck and a warehouse rack. A widely cited review of container<\/a> loading makes the same point: many proposed approaches have been criticized as having limited practical value because they ignore constraints met in practice (Bortfeldt & W\u00e4scher, 2013<\/u><\/a>). The ones that matter most on a pallet:<\/p>\n\n\n\n