Scribd
Upload
5 views4 pages

Assignment Problem

The document outlines a logistics assignment problem where five vehicles must be assigned to five routes to minimize delivery costs based on a given cost matrix. It describes the Hungarian method for solving the assignment problem, including steps for row and column reductions, covering zero elements, and constructing assignments. An example is provided to illustrate the process and demonstrate how to achieve optimal assignments with minimal costs.

Uploaded by

chimata.vinitha21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views4 pages

Assignment Problem

The document outlines a logistics assignment problem where five vehicles must be assigned to five routes to minimize delivery costs based on a given cost matrix. It describes the Hungarian method for solving the assignment problem, including steps for row and column reductions, covering zero elements, and constructing assignments. An example is provided to illustrate the process and demonstrate how to achieve optimal assignments with minimal costs.

Uploaded by

chimata.vinitha21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment decision

• A logistics company must assign five vehicles to five different routes on a day for
delivery. Each vehicle can be assigned only one route and each route is to be
covered by one vehicle only. The cost of delivery on different routes varies with
the type of vehicle used. This cost matrix is given below (values in ten thousand
rupees). Determine the minimum cost assignment of vehicles to routes.

Routes
Vehicles
1 2 3 4 5
1 4 8 7 9 10
2 7 6 5 10 9
3 10 7 9 5 6
4 9 4 8 10 7
5 7 9 5 6 10
Hungarian method
1. From the cost matrix,
• find the smallest element in each row and subtract that from each element – row reduction
• find the smallest number in each column and subtract that from each element – column
reduction
2. In the reduced matrix, find the minimum number of lines (rows or columns) that
will cover all the zero elements
• If this is equal to the number of rows of the matrix, we are done, go to step 4
• If not, go to step 3
3. Find the smallest uncovered element and subtract that from all uncovered
elements, and add to the intersection points of cover lines and go back to step 2
4. Construct an assignment using all the zero elements – one selection for every row
and column
Assignment problem - example
• Assigning people to tasks, jobs to machines etc.
• One person can be allocated only one task
• Each task is to be done by one person only
• The cost of allocation of a person to a task is given below
• Which person should do which task to minimize total cost?

1 4 6 3
9 7 10 9
4 5 11 7
8 7 8 5
After row and column reductions

90 75 75 80 15 0 0 5 15 0 0 0 Three lines enough


35 85 55 65 0 50 20 30 to cover all zeros – so
0 50 20 25
not done yet
125 95 90 105 35 5 0 15 35 5 0 10
45 110 95 115 0 65 50 70 0 65 50 65

35 0 0 0 Three lines enough


to cover all zeros – so The zero cells at every stage indicate
0 30 0 5
not done yet partial assignment possibilities.
55 5 0 10 These zero cells can be used to create
0 45 30 45 valid assignments

Cost: 275 Cost: 275

40 0 5 0 1 1
0 25 0 0 1 1 Both these are
valid optimal
55 0 0 5 1 1
assignments
0 40 30 40 1 1
Now done Final solution - 1 Final solution - 2

You might also like