Warehouse size

Products / slots: 6

Order-frequency data

View

Selected cell (click heatmap)

Product—

Slot—

Order freq—

Slot distance—

Cell cost—

Solver stats

Optimal total cost—

Greedy total cost—

Improvement—

Matrix size—

The cost matrix (top-right heatmap) is products × storage slots, where cost = order-frequency(product) × distance-from-dock(slot). The genuine Kuhn-Munkres (Hungarian) algorithm — row/column reduction with dual potentials, alternating-tree augmenting paths — finds the exact one-to-one assignment minimizing total pick-travel cost, in O(n³) time. The greedy baseline just assigns each product to its cheapest still-free slot in order, which is fast but usually suboptimal — the panel shows exactly how much cost the exact algorithm saves.