Académique Documents
Professionnel Documents
Culture Documents
Module/submodel: Transportation
Problem title: (untitled)
Starting method: Any starting method
Objective: Minimize
Original Data
1 2 3 4 5 6 SUPPLY
---------------------------------------------------------------------------------------
1 10000 12 17 18 10 20 37
2 14 10000 10 19 16 15 20
3 14 10 10000 12 8 9 14
4 8 16 14 10000 12 15 26
5 11 21 16 18 10000 10 40
6 24 12 9 17 15 10000 28
DEMAND 30 25 20 40 30 20
Shipments
1 2 3 4 5 6
----------------------------------------------------------------------------
1 7 30
2 20 0
3 14
4 26
5 4 16 20
6 18 10
1 2 3 4 5 6
----------------------------------------------------------------------------
1 9990 9 1 11
2 2 9986 4 4
3 9 3 9997 3 5
4 6 8 9985 4 8
5 8 7 9989
6 14 1 5 9991
1 2 3 4 5 6
----------------------------------------------------------------------------
1 (9990) 7 (9) (1) 30 (11)
2 (2) (9986) 20 0 (4) (4)
3 (9) (3) (9997) 14 (3) (5)
4 26 (6) (8) (9985) (4) (8)
5 4 (8) (7) 16 (9989) 20
6 (14) 18 (1) 10 (5) (9991)
Iterations ----------
Iteration 1
1 2 3 4 5 6
----------------------------------------------------------------------------
1 (9994) 23 (9) (1) 14 (15)
2 (6) (9986) 20 (0) (4) (8)
3 (13) (3) (9997) 14 (3) (9)
4 10 (2) (4) (9981) 16 (8)
5 20 (4) (3) (-4) (9985) 20
6 (18) 2 (1) 26 (5) (9995)
Iteration 2
1 2 3 4 5 6
----------------------------------------------------------------------------
1 (9990) 7 (9) (1) 30 (11)
2 (2) (9986) 20 (0) (4) (4)
3 (9) (3) (9997) 14 (3) (5)
4 26 (6) (8) (9985) (4) (8)
5 4 (8) (7) 16 (9989) 20
6 (14) 18 (1) 10 (5) (9991)
1 2 3 4 5 6
----------------------------------------------------------------------------------------------------
1 7/$84 30/$300
2 20/$200 0/$0
3 14/$168
4 26/$208
5 4/$44 16/$288 20/$200
6 18/$216 10/$170