Business Mathematics and Statistics · Ch 10 — Operations Research (Transportation Problem, Assignment Problems, Decision Theory)
Vogel's Approximation Method (VAM)
Vogel's Approximation Method (VAM)
Vogel's Approximation Method (VAM)
Vogel's Approximation Method is the most reliable of the three IBFS methods because it uses a penalty — the extra cost of not choosing the cheapest cell in a row or column — to decide where to allocate next, rather than looking only at the single cheapest cell in the whole table.
Rule (repeated until all rows/columns are exhausted):
- For every remaining row and every remaining column, compute the penalty = (second-lowest cost) − (lowest cost) in that row/column.
- Select the row or column with the largest penalty.
- In that row/column, allocate the maximum possible to its lowest-cost cell.
- Cross out the row or column that is now exhausted, and recompute penalties for what remains.
Worked example — same cost matrix as the earlier examples
| Supply | ||||
|---|---|---|---|---|
| 6 | 8 | 10 | 30 | |
| 7 | 11 | 11 | 50 | |
| 4 | 5 | 12 | 20 | |
| Demand | 25 | 35 | 40 | 100 |
Round 1 — penalties: Row : . Row : . Row : . Column : . Column : . Column : .
Largest penalty is 4 (row ). Lowest cost in that row is : allocate . is exhausted; has 25 units left.
Round 2 (remaining columns ; supplies ) — penalties: Row : . Row : . Row : . Column : . Column : .
Largest penalty is 7 (row ). Lowest cost in that row is : allocate . is exhausted; has 15 units left.
Round 3 (remaining ; supplies ) — penalties: Row : . Row : . Column : . Column : .
Largest penalty is 3 (column ). Lowest cost in that column is : allocate . is exhausted; has 15 units left.
Round 4 (only left; , ): allocate , then .
Allocation table (VAM)
| Row total | ||||
|---|---|---|---|---|
| — | 15 | 15 | 30 | |
| 25 | — | 25 | 50 | |
| — | 20 | — | 20 | |
| Column total | 25 | 35 | 40 | 100 |
Feasible, with 5 occupied cells ().
Total cost
Comparing the three methods on the identical cost matrix …
For a row or column, the difference between its two lowest unit costs; VAM always allocates next in the row or column with the largest penalty, at that …