Assign each facility (1, 2, 3, 4, 5, 6, 7) to one location (A, B, C, D, E, F, G). The distance matrix and the required flows are shown below.
- Click “Compute” to see the solution value.
- Click “Reset” for the default configuration.
- Click “Optimal” to see the optimal solution.
A B C D E F G
Solution Value
A | B | C | D | E | F | G | |
---|---|---|---|---|---|---|---|
A | 0 | 35 | 71 | 99 | 71 | 75 | 41 |
B | 35 | 0 | 42 | 80 | 65 | 82 | 47 |
C | 71 | 42 | 0 | 45 | 49 | 79 | 55 |
D | 99 | 80 | 45 | 0 | 36 | 65 | 65 |
E | 71 | 65 | 49 | 36 | 0 | 31 | 32 |
F | 75 | 82 | 79 | 65 | 31 | 0 | 36 |
G | 41 | 47 | 55 | 65 | 32 | 36 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | 7 | |
---|---|---|---|---|---|---|---|
1 | 0 | 2 | 0 | 0 | 0 | 0 | 2 |
2 | 2 | 0 | 3 | 0 | 0 | 1 | 0 |
3 | 0 | 3 | 0 | 0 | 0 | 1 | 0 |
4 | 0 | 0 | 0 | 0 | 3 | 0 | 1 |
5 | 0 | 0 | 0 | 3 | 0 | 0 | 0 |
6 | 0 | 1 | 1 | 0 | 0 | 0 | 0 |
7 | 2 | 0 | 0 | 1 | 0 | 0 | 0 |