Transhipment problems

Problem Set 10
Problem 2
7/unit
Rail (unlimited)

80 F1 trucks W1 60
50 trucks 50
3/unit 2/unit
D

trucks 50
trucks 4/unit 4/unit
F2 W2
50
70 90
Rail (unlimited)
9 /unit

from to ship capacity unit costs

f1 d 50 50 3
f1 w1 30 999999 7
f2 d 30 50 4
f2 w2 40 999999 9
d w1 30 50 2
d w2 50 50 4
total cost 1100

nodes outflow inflow netflow requirement

f1 80 0 80 80
f2 70 0 70 70
d 80 80 0 0
w1 0 60 -60 -60
w2 0 90 -90 -90
Rail - direct distribution
 from to ship capacity unit costs
f1 w1 10 9999 900
f1 dc 40 9999 400
f1 f2 0 10 200
f2 dc 40 9999 300
dc w2 80 80 100
w1 w2 0 9999 300
w2 w1 20 9999 200
total 49000

nodes outflow inflow netflow requirement

f1 50 0 50 50
f2 40 0 40 40
dc 80 80 0 0
w1 0 30 -30 -30
w2 20 80 -60 -60
shortest path problem

1 supply
1 demand
many transhipment nodes

Problem Set 11
Problem 1

from to on route distance

1 2 0 25
1 3 1 20
2 3 0 3
2 4 1 5 route 1-3-2-4-6
2 6 0 14
3 2 1 3
3 5 0 6
4 2 0 5
4 5 0 4
4 6 1 4
5 3 0 6
5 4 0 4
5 6 0 7
total 32

node outflow inflow netflow requirement

1 1 0 1 1
2 1 1 0 0
3 1 1 0 0
4 1 1 0 0
5 0 0 0 0
6 0 1 -1 -1
Problem 2

from to on route distance

O A 1 2
O B 0 5
O C 7.772E-16 4
A B 1 2
A D 0 7
B A 0 2
B D 0 4
B C 0 1
B E 1 3
C B 7.772E-16 1
C E 0 4
D A 0 7
D B 0 4
D E 0 1
D T 1 5
E C 0 4
E B 0 3
E D 1 1
E T 0 7
total 13 = 13 new constraint
new object 2
(maximise this)

node outflow inflow netflow requirement

O 1 0 1 1
A 1 1 0 0
B 1 1 0 0
C 7.772E-16 7.772E-16 0 0
D 1 1 0 0
E 1 1 0 0
T 0 1 -1 -1
new constraint
Problem 3

from to on route distance

O A 1 40 shortest path
O B 0 60 o-a-b-e-d-f
O C 0 50
A B 1 10
B A 0 10
A D 0 70
D A 0 70
B C 0 20
C B 0 20
B D 0 55
D B 0 20
B E 1 40
E B 0 40
C E 0 50
E C 0 50
D E 0 10
E D 1 10
D F 1 60
E F 0 80
total 160

node outflow inflow netflow requirement

O 1 0 1 1
A 1 1 0 0
B 1 1 0 0
C 0 0 0 0
D 1 1 0 0
E 1 1 0 0
F 0 1 -1 -1
Problem Set 11
Problem 4

from to on route distance

SE A no
SE B
SE C
A D
A E
B D
B E
B F
C E
C F
D LN
E LN
F LN
mid term 3 problems(60 mins) 2 to 3 questions from asignm
lp -2 2-3 in class
sensitivity -2 2-3 changed
integer -2
networks -2

end term 4 problems(75 min)

2 to 3 questions from asignment
2-3 in class
2-3 changed