Scribd
Upload
2 views

Week6_Part2

The document discusses assignment and transshipment problems in operations research, focusing on the Hungarian method for solving assignment problems and the conversion of transshipment problems into balanced transportation problems. It outlines the steps involved in applying the Hungarian method and emphasizes the importance of balancing supply and demand in transshipment scenarios. Examples illustrate the concepts, including how to handle unbalanced problems by adding dummy nodes.

Uploaded by

senasivrikaya
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

Week6_Part2

The document discusses assignment and transshipment problems in operations research, focusing on the Hungarian method for solving assignment problems and the conversion of transshipment problems into balanced transportation problems. It outlines the steps involved in applying the Hungarian method and emphasizes the importance of balancing supply and demand in transshipment scenarios. Examples illustrate the concepts, including how to handle unbalanced problems by adding dummy nodes.

Uploaded by

senasivrikaya
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/ 19

EMÜ 222

Deterministic Operations
Research
2023-2024 Spring

Week 6
Assignment Problems
Transshipment Problems

Winston W.L., Operations Research, Chapter 7


Assignment Problems

- A special type of transportation problem with m supply


and m demand points, each with 1 unit of supply and
demand.

Example. 4 jobs to be processed on 4 machines. Which job


should be assigned to which machine? Each job should be
completed and each machine should be assigned to a job.
Assignment Problems
Assignment Problems

𝑀𝑖𝑛 𝑧 = σ4𝑖=1 σ4𝑗=1 𝑐𝑖𝑗 𝑥𝑖𝑗


s.t.

σ4𝑗=1 𝑥𝑖𝑗 = 1 𝑓𝑜𝑟 𝑖 = 1, … , 4 Each machine is assigned to a job

σ4𝑖=1 𝑥𝑖𝑗 = 1 𝑓𝑜𝑟 𝑗 = 1, … , 4 Each job is assigned to a machine

𝑥𝑖𝑗 = 0 𝑜𝑟 1
Assignment Problems

Can be solved with transportation simplex method, but it


is inefficient.

We will use Hungarian method:


Hungarian Method. Example.

Subtract the min.


cost from each row.

Subtract the min.


cost from each
column.
Draw the min. number
of lines to cover 0’s.

3 lines are enough.


Continue with Step 3.
Find the smallest
uncovered element (=1).
Subtract 1 from each
uncovered element, and
add 1 to each twice-
covered element.
Draw the min. number
of lines to cover 0’s.

4 lines required :
Optimal found.

3rd machine should be


assigned to 3rd job.
4th machine should be
assigned to 1st job.
2nd job should be
assigned to 1st machine.
4th job should be
assigned to machine 2.
Optimal solution:
Notes on the Hungarian Method

- If a constant is added to each cost in a row (or column) of a


balanced transportation problem then the optimal solution to
the problem is unchanged.
- Adding k to each cost in the first row:
New z-value = Old z-value + 𝑘(𝑥11 + 𝑥12 + 𝑥13 + 𝑥14 )

Since 𝑥11 + 𝑥12 + 𝑥13 + 𝑥14 = 1, New z−value = Old z−value + 𝑘

- We add a constant to each row/column in Step 1.


- The operations in Step 3 is equivalent to adding k to each
covered row and subtracting k from each uncovered column.
Notes on the Hungarian Method

- Steps 1 & 3 ensure that all costs remain nonnegative.


- In Step 3, when we draw m lines, there is a solution with 0-cost
assignments whose z-value is 0. It is the optimal solution of the
original problem.

- The Hungarian method may yield an incorrect solution for an


unbalanced problem. If the number of rows/columns are
unequal (and the problem is unbalanced), then the problem
should be balanced by adding dummy nodes, to be solved by
the Hungarian method.
- If some jobs cannot be done by some workers, use M as their
cost.
Transshipment Problems

In transportation problems, shipments go directly from supply


points to demand points.
But there may also be other points through which goods can be
transshipped on their journey.

Supply point: Point that can send goods to another point, but
cannot receive goods.
Demand point: Point that receives goods from other points, but
cannot send goods.
Transshipment point: Points that can both receive goods from
other points, and send goods to other points.
Example.
All possible shipments

The optimal can be found solving a transportation problem.


First, convert the problem to a balanced transportation
problem.
Converting a transshipment problem to a
transportation problem

Step 1. Balance the problem by adding dummy


supply/demand point, if necessary.

Step 2. Add transshipment nodes to supply nodes & to


demand nodes.
The supply and demand nodes will have supply/demand
equal to their own supply/demand.
Let s be the total supply.
The transshipment nodes’ supply = its own supply + s
The transshipment nodes’ demand = its own demand + s
Example.
In our example problem, total supply = 150 + 200 = 350
Total demand = 130 (2) = 260

We should add a dummy demand with D = 350-260 = 90.


Example.

Chicago supplies itself: it is not used.


20 units from Memphis, 70 units from Denver are not sent.
Memphis sends 130 units to L.A. through N.Y.
Example. Optimal Solution.
What if shipments between Memphis and Denver are allowed?

Then, Memphis and Denver would become transshipment points.


New columns would be added for M & D, with demand equal to s.
Their supply would increase by s.

N.Y. Chicago L.A. Boston Memphis Denver Dummy


Memphis 500
Denver 550
N.Y. 350
Chicago 350
350 350 130 130 350 350 90
What if shipments between L.A. and Boston are allowed?

Then, L.A. and Boston would become transshipment points.


New rows would be added for L.A. & B, with supply equal to s.
Their demand would increase by s.

N.Y. Chicago L.A. Boston Dummy


Memphis 150
Denver 200
N.Y. 350
Chicago 350
L.A 350
Boston 350
350 350 480 480 90

You might also like