Scribd
Upload
2 views

Assignment Problem Hungarian Algorithm

Uploaded by

anakinalt9
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
2 views

Assignment Problem Hungarian Algorithm

Uploaded by

anakinalt9
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/ 2

Assignment Problem using Hungarian Algorithm

Step 1: Original Cost Matrix

| J1 | J2 | J3

W1 | 9 | 2 | 7

W2 | 6 | 4 | 3

W3 | 5 | 8 | 1

Step 2: After Row and Column Reduction

| J1 | J2 | J3

W1 | 4 | 0 | 5

W2 | 0 | 1 | 0

W3 | 1 | 7 | 0

Step 3: Cover All Zeros with Minimum Lines

Zeros at positions:

- (W1, J2)

- (W2, J1), (W2, J3)

- (W3, J3)

Lines used: 3 (Column J2, Row W2, Column J3)

Since 3 lines = n (3), we proceed to assignment.

Step 4: Optimal Assignment (from reduced matrix)

Assignments:

- W1 to J2 (0)

- W2 to J1 (0)

- W3 to J3 (0)

Step 5: Final Result (from original matrix)

| J1 | J2 | J3
W1 | 9 | 2 | 7

W2 | 6 | 4 | 3

W3 | 5 | 8 | 1

Final Assignments:

- W1 to J2 = 2

- W2 to J1 = 6

- W3 to J3 = 1

Total Minimum Cost = 2 + 6 + 1 = 9

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy