IENG 212 Modeling and Optimization Name Uur Surname

  • Slides: 15
Download presentation
IENG 212 Modeling and Optimization Name: Uğur Surname: ASLAN No: 131882

IENG 212 Modeling and Optimization Name: Uğur Surname: ASLAN No: 131882

I will talk about transportation models and show example.

I will talk about transportation models and show example.

Transportation Models

Transportation Models

Transportation Models

Transportation Models

Basic feasible solution can be obtained by three methods, they are North - west

Basic feasible solution can be obtained by three methods, they are North - west corner method, Least - cost cell method, Vogel's Approximation Method, generally known as VAM.

NORTH-WEST Corner Method Albuquerqu e 5 Des Moines 8 Evansville 9 Fort Lauderdale Demand

NORTH-WEST Corner Method Albuquerqu e 5 Des Moines 8 Evansville 9 Fort Lauderdale Demand 300 Boston 4 4 7 200 Cleveland 3 3 5 200 Capacity 100 300 700

Step 1 Start from the left hand side top corner or cell and make

Step 1 Start from the left hand side top corner or cell and make allocations depending on the availability and requirement constraint.

Step 2 By satisfying availability and requirement constraints fill the other cells. Z=100 5

Step 2 By satisfying availability and requirement constraints fill the other cells. Z=100 5 + 200 8+100 4+100 7+200 5=500+1600+400+700+1000=4200 $

LEAST COST method Identify the lowest cost cell in the given matrix. In this

LEAST COST method Identify the lowest cost cell in the given matrix. In this particular example it is 3. Make allocations to this cell. After filling search for lowest cost cell. Proceed this way until allocations are made. Z=300 9+200 4+100 3=2700+800+300=4100 $

Vogel’s Approximation Method (VAM) Step 1: For each row and column find the difference

Vogel’s Approximation Method (VAM) Step 1: For each row and column find the difference between the two lowest unit shipping costs.

Step 2 Assign as many units as possible to the lowest-cost square in the

Step 2 Assign as many units as possible to the lowest-cost square in the row and column selected.

Step 3 Eliminate the column or row that has been satisfied.

Step 3 Eliminate the column or row that has been satisfied.

Z= 100 5+200 4+100 3+200 9+100 5=500+800+300+1800+500=3900 $

Z= 100 5+200 4+100 3+200 9+100 5=500+800+300+1800+500=3900 $

 Thank you for watching and listening. Any questions?

Thank you for watching and listening. Any questions?