1 of 8 0-day streak

Find an optimum assignment with the Hungarian algorithm

Question 1 of 8

Calculator allowed

A delivery depot assigns vans to routes. The rows represent the vans and the columns represent the routes. Each entry is an integer distance in km

The aim is to minimise the total distance. Use the reductions and independent zeros to find the required assignment

Original distance table (km)
Row	Route A	Route B	Route F
Van A	32	36	16
Van B	44	24	40
Van C	24	52	52

(a)3 marks

Complete the row minima needed for the Hungarian reduction

Van A minimum Van B minimum Van C minimum

(b)1 mark

Select the complete allocation with the optimum original total

Van A → Route F; Van B → Route B; Van C → Route A

Van A → Route A; Van B → Route B; Van C → Route F

Van A → Route F; Van B → Route A; Van C → Route B

Van A → Route F; Van B → Route F; Van C → Route A

Enter the optimum original total distance

Optimum total distance (km)