This web app selects those warehouses that come with minimal supply costs given the supply costs from each warehouse to each customer, and the number of warehouses to be opened per warehouse group. This tool simply evaluates all permutations. Selecting 5 out of 50 warehouses (2.1 million permutations) is possible, but selecting 10 out of 40 warehouses (848 million permutations) will cause a run time issue (would require a different algorithm).
Input: warehouse-customer supply costs & warehouse groups
Semicolon or tab separated; you can copy data from MS Excel into the text area.
- The top row specifies the warehouse group, labeled a,b,c,d,e,f, g or j. Warehouses within the same group should sit next to each other: "a a b b c" is valid top row input, "a b c a b" is not.
- Next rows contain supply cost for each warehouse-customer-combination. In the example data, supplying the 3rd customer Cust_0003 from the 2nd warehouse WH_02 will cost 17.
Input: number of warehouses to open