Professional Documents
Culture Documents
Trabajo de Redes
Trabajo de Redes
Iteración 0
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
0
0
E 900 I 380
0 0
90 0
0
0
00
40 0
0
60
0
80
0
0
0 0
5000 0 10 P
I B
120 0
0
35 0
10
0 0 0 0
0
00
0 10 000
800 3
0
F J
0 80
00
0 0 0
16
0
140
C
1 00
0
00
30
00
0
0
12
0
0
0
0 80 0
G K
800 0
Ruta {S, C, G, I,P}
Iteración 1 Min {3500, 1000, 1200, 3800} =1000 vehículos
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
0
0
E 900 I 380
0 0
90 0
0
0
0 0
40 0
0
60
0
80
0
0
0 0
5000 0 10 P
S B
120 0
0
35 0
10
0 0 0 0
0
0
0 10 0
0
800 300
0
F J
0 80
00
0 0 0
16
0
140
C
1 00
0
00
30
00
0
0
12
0
0
0
0 80 0
G K
800 0
Ruta {S, C, F, I,P}
Iteración 2 Min {2500, 1400, 1000, 2800} =1000 vehículos
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
0
0
E 900 I 280
0 0
90 0
0
0
0 0
40 100
00
0
60
0
0
10
1000 1000
80
0
00
5000 0 10 P
S B
120 0
0
25 0
10
00 0 0 0
0
0 10 0
0
800 300
0
F J
10 0 80
00
00 0 0
16
0
140
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, C, E, J,P}
Iteración 3 Min {1500, 1600, 900, 3000} =900 vehículos
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
0
0
E 900 I 180
0 0
90 00
00
0 10 1000
0
1000 40 200
00
0
60
0
0
10
1000 1000
80
0
0 0
5000 0 10 P
S B
120 0
0
15 0 0
10
00
0
0 0 0
0
800 300
0
F J
20 0
100 80
00
00 0 0
16
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, B, E, I,P}
Iteración 4 Min {5000, 1000, 900, 1800} =900 vehículos
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
0
0
E 900 I 180
0 0
900 0 00 900
0
0 10
90
1000 00 200 1000
00
0
4
60
0
0
10
1000 1000
80
0
00
5000 0 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, A, D, H,P}
Iteración 5 Min {4000, 1500, 1200, 2200} =1200 vehículos
0 1200 0
D H
22
90 0 0
0
0
150
0
0
10
1500
0
A
0
0 0 0 0
10 0
100
900
0
E 0 I 900
900 900 900
900 0 00 900
0
00 10
90
1000 290 1000
40
00
0
60
0
0
10
1000 1000
80
0
0
4100 0 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, A, E, H,P}
Iteración 6 Min {2800, 1500, 1000, 1000} =1000 vehículos
0 0 1200
120 D H
10
90 0 0
0
300
0
0
10
1500
0
A
0
00 0 0 0
12 10 0
100
900 1200
0
1200 E 0 I 900
900
900 900 0
0 0 900
12
900
0
0 10
90
0
1000 80 290 1000
0
00
2
60
0
0
10
1000 1000
80
0
0
4100 0 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, B, D, I,P}
Iteración 7 Min {4100, 800, 900, 900} =800 vehículos
0 0 1200
120 D H
0
90 0 0
300 0 100
10
500
0
A
0
00 1 00
0 0
22
100
0 1000
1000
900 1200
0
1200 E 0 I 900
900
900 900 0
0 0 900
22
900
0
0 10
90
0
1000 80 290 1000
0
00
1
60
0
0
10
1000 1000
80
0
0
4100 0 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, A, D, I,P}
Iteración 8 Min {1800, 300, 100, 100} =100 vehículos
0 0 1200
120 D H
0
10 0 0
300 80
0 100
10
500
0
A
0
00 1 00 800 800
800 0
22
100
0 1000
1000
900 1200
0
1200 E 0 I 100
900
900 900 0
0 0 900
22
900
0
0 10
90
0
1000 80 270 1000
0
00
1
60
0
10
1000 1000
0
0
0
3300 8000 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
30
0
0
0
20
0
10 0
0
00 80 0
G K
800 0
Ruta {S, C, E, K,P}
Iteración 9 Min {600, 700, 600, 3000} =600 vehículos
0 0 1200
130 D H
0
0 0
200 80
0 100
10
500
0
A 100
0
100
00 1 00 900 800
800 0
23
100
0 1000
1000
900 1200
0
1200 E 0 I 0
900
900 900 0
0 0 900
22
900
0
0 10
90
0
1000 70 280 1000
0
00
1
60
0
10
1000 1000
0
0
0
3300 8000 10 P
S B
120
0 9 00
60 90 0
10
0 0
0
0 0 0
0
800 210
0
F J
29 0
00 100 80 0
0
0
70
400
C
0
00
0
0
0
0
30
20
10 0
0
00 80 0
G K
800 0
Ruta {S, A, G, J,P}
Iteración 10 Min {1700, 1000, 800, 2100} =800 vehículos
0 0 1200
130 D H
0
0 0
200 80
0 100
600
10
600 500
0
A 100
0
100
00 1 00 900 800
800 0
23
100
0 1000
1000
900 1200
0
1200 E 0 I 0
900
900 900 0
0 900
0
0
22
900
0
0 10
15
0
1000 70 280 1000
0
00
1
0
0
10
1000 1000
0
0
3300 8000 10 P
S B
120
0 9 00
0
0 90 60
10
0
0
0 0 0
0
800 210
0
F J
35 0
00 100 80 0
0
0
10
400
C
0
00
0
600
0
0
24
20
10 0
0
00 80 0
G K
800 0
Ruta {S, B, F, J,P}
Iteración 11 Min {3300, 1200, 800, 1300} =800 vehículos
0 0 1200
130 D H
0
0 0
200 80
0 100
800
800
600
10
600 500
0
A 100
0
100
00 1 00 900 800
800 0
31
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
15
0
1000 00 280 1000
0
00
9
0
0
10
1000 1000
0
0
3300 800 10 P
S B 0
120
0 1 70
0
0 90 60
10
0
0
0 0 0
0
800 130
0
F J
35 0
00 100 80 8 00
0
0
10
400
C
0
00
80
600
0
0
24
0
20
10
0
00 0 0
G K
800 0
Ruta {S, B, F, J,P}
Iteración 12 Min {2500, 400, 800, 2400} =400 vehículos
0 0 1200
130 D H
0
0 0 800
800 200 80
0 100
800
800
600
10
600 500
0
A 100
0
100
00 1 00 900 800
800 0
31
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
15
0
1000 00 280 1000
0
00
9
0
0
10
1000 1000
0
0
2500 1600 10 P
S B 0
400 2 50
0
0 90 60
10
800 0
0
0
0
0 500
800
F J
35 0
00 100 80 8 00
0
0
10
400
C
0
00
80
600
0
0
24
0
20
10
0
00 0 0
G K
800 0
Ruta {S, B, G, K,P}
Iteración 13 Min {2100, 1000, 800, 200} =800 vehículos
0 0 1200
400 130 D H 400
0
0 0 800
800 200 80
0 100
800
800
600
10
600 500
0
A 100
0
100
00 1 00 900 800
800 0
31
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
15
0
1000 00 280 1000
0
00
9
0
0
10
1000 1000
0
0
2100 2000 10 P
S B 0
0 2 50
00
0 90 10
10
1200 0
0
0
0
0 500
800
F J
25 0
00 100 40 8 00
0
0
10
400
C
0
00
80
600
0
0
20
0
40
20
10 0
0
00 0
G K
800 0
Ruta {S, A, E,C,F, K,P}
Iteración 14 Min {900, 500, 1500, 400,400,1200} =400
vehículos
800 800
0 0 1200
400 130 D H 400
0
0 0 800
800 200 80
0 100
800
800
600
10
600 500
0
A 100
0
100
00 1 00 900 800
800 0
31
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
15
0
1000 00 280 1000
0
00
9
0
0
10
1000 1000
0
0
1300 2800 10 P
S B 0
0 2 50
00
0 90 18
20
1200 0
0
0
0 500
800
F J
35 0
00 100 40 8 00
0
0
10
400
C
0
00
80
600
0
0
12
0
80
40
20
10 0
0
00 0
G K
0 800
Ruta {S, A, D, K,P}
Iteración 15 Min {500, 200, 1000, 800} =200 vehículos
400 400
800 800
0 0 1200
400 130 D H 400
0
0 0 800
800 200 80
0 100
800
800
600
10
600 100
0
A 100
0
100
00 1 40 900 800
800 0
35
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
11
0
1000 00 280 1000
0
00
5
0
0
10
1000 1000
0
0
1300 2800 10 P
S B 0
0 2 50
00
0 90 22
20
1200 0
0
0
0 500
800
F J
35 0
00 140 0 8 00
0
50
0
C
0
80
0
600
0
0
80
0
80
80
20
10 0
0
00 0
G K
0 800
Ruta {S, B, G, I, D, K,P}
Iteración 16 Min {1300, 200, 200, 900, 800, 600} =200
vehículos
200 200
400 400
800 800
0 0 1200
400 150 D H 400
0
0 0 800
800 0 80
0 100
800
800
600
80
600 100
0
A 100
100
00 1 40 900 800
800 0
37
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
11
0
1000 00 280 1000
0
00
3
0
0
10
1000 1000
0
0
1300 2800 10 P
S B 0
0 2 50
00
0 90 24
20
1200 0
0
0
0 500
800
F J
35 0
00 140 0 8 00
0
50
0
C
0
20
80
0
600
0
0
60
0
80
80
20
10 0
0
00 0
G K
0 800
FLUJO MAXIMO : 11100 Vehículos
200 200
200 200
400 400
800 800
0 0 1200
400 150 D H 400
0
20 0 0 800
800 0 80
0 100
800
800
600
60
600 100
0
A 100
100
00 1 40 700 800
800 0
37
200
0 1000
1000
0 900 0 1200
1200 E I 900
900 900 0
0 900
0
0
22
900
0
10
11
0
1000 00 380 1000
0
00
3
0
0
12
1000 1000
0
0
1100 3000 10 P
11100 S B 11100
0
0 2 50
00
0 90 22
0
1200 0
0
0 500
800
F J
35 0
00 140 0 8 00
0
50
0
C
0
40
80
0
600
10
0
40
0
80
0
10 0
0
00 0
G K
0 800
Problema 2
[27 ; D]
RUTA MINIMA [15 ; A] [23 ; E]
DE “A” 12
D H
15
9 [24 ; D]
22
[22 ; E]
A 13 [13 ; A] 10 [48 ; K]
[22 ; G]
9 [48 ; J]
E I 38 [60 ; I]
[45 ; H]
10
16 10 P
9 [22 ; E]
[18 ; G]
10
30
6
8
F J
14
12
c
[25 ; D]
30
8
10 [19 ; E]
[10 ; A] 8 [18 ; G]
G K
8
RUTA MINIMA [26 ; E]
DE “B” 12
D H
15
9 [25 ; E]
22
[24 ; F] [60 ; I]
A 13 [16 ; C] 10 [22 ; G] [48 ; J]
9
E I 38
[48 ; K]
[48 ; H]
10
16 10 [22 ; F] P
9 [25 ; E]
[14 ; C] [18 ; G]
10
30
6
8
F J
14
12
c
[22 ; E]
30
8
10 [22 ; F]
[10 ; C] 8 [18 ; G]
G K
8
Problema 3
43/6
RED DE ACTVIDADES DE
BOEING: 5
324/6=54
209/6
/6 13
43 209/6 251/6
G– 3/ 6
K–7
J-7 54
10 12
F – 49/6
33/2
251/6
53/2 209/6
2 H – 10
6
33/2
2
179/6
33/
C–
D-
40
0
/3
179/6
I-3 197/6
1 7
179/6
A-
179/6 9 209/6
71
0 4
/6
197/6 11
179/6
71/6 209/6
2
E-
3 B-2 197/6
8
197/6
197/6
64/3
RED DE ACTVIDADES DE
AIR BUS: 5
165/3=55
107/3
13
5 107/3 128/3
G– 7/ 3
K–3
J-7 55
10 12
F–9
49/3
128/3
76/3 107/3
2 H–9
6
49/3
3
94/3
49/
C–
D-
15
0
94/3
101/3
1 7 I–7
94/3 /3
A-
94/3 9 107/3
37
0 4
/3
101/3 11
94/3
71/6 107/3
2
E-
3 B-3 101/3
8
101/3
101/3
Problema 4
FLUJO CON COSTO MINIMO
(0 ; 6; $4)
2 4
2) (0
;
;$ M
;$
;M 1)
(0 (0 ; M ; $3)
(0 ; M ; $2)
-10
5)
10
;$
6
1
;3
(0
(0 4)
; M ;$
;$ ;M
7) (0
3 5
(0 ; M ; $3)
Fij lij uij cij
FLUJO INICIAL f12 0 M 2
f13 0 M 7
f23 0 M 3
f24 0 6 4
f34 0 3 5
f35 0 M 3
0 f45 0 M 2
2 4
f46 0 M 1
0 f56 0 M 4
0
10
-10
0
0
6
0
10 10
3 5
10
Prueba de Optimalidad
Fij lij uij cij
f12 0 M 2
π2 π4
f13 0 M 7
0
2 4 f23 0 M 3
f24 0 6 4
0
0
π6 f34 0 3 5
π1
f35 0 M 3
10 -10
6 f45 0 M 2
0
0
1
0
f46 0 M 1
f56 0 M 4
10
10
3 5
10
π3
π5
f23 0 M 3
0
0
π6 f24 0 6 4
π1
f34 0 3 5
10 -10
6 f35 0 M 3
0
0
1
0
f45 0 M 2
f46 0 M 1
f56 0 M 4
10
10
3 5
10
π3 π5
1-2: C12 – π1 + π2=0 2 – 0 + π2=0 π2= -2
1-3: C13 – π1 + π3=0 7 – 0 + π3=0 π3= -7
3-5: C35 – π3 + π5=0 3 – (-7) + π5=0 π5= -10
4-5: C45 – π4 + π5=0 2 – π4 - 10=0 π4= -8
4-6: C46 – π4 + π6=0 1 – (-8) + π6=0 π6= -9
Costo Reducido de los Arcos No básicos
f23 0 M 3
0
0
π6 f24 0 6 4
π1
f34 0 3 5
10 -10
6 f35 0 M 3
0
0
1
0
f45 0 M 2
f46 0 M 1
f56 0 M 4
10
10
3 5
10
π3 π5
F23=l23: C’ 23 = C23 – π2 + π3 C’23 = 3 –(-2) -7 C’23= -2
F24=l24: C’ 24 = C24 – π2 + π4 C’24 = 4 –(-2) -8 C’24= -2
F34=l34: C’ 34 = C34 – π3 + π4 C’34 = 5 –(-7) -8 C’34= 4
F45=l45: C’ 45 = C45 – π4 + π5 C’23 = 2 –(-8) -10 C’23= 0
Costo Reducido de los Arcos No básicos
π2 π4
fij lij uij cij
0+ε f12 0 M 2
2 4
f13 0 M 7
ε
0+
0+
π6 f23 0 M 3
ε
π1 f24 0 6 4
10 -10
6 f34 0 3 5
0
0
1
f35 0 M 3
0
f45 0 M 2
-ε
f46 0 M 1
10
10
ε-
f56 0 M 4
3 5
10-ε
π3
π5
ε12= Abs(f12-u12) ε12=Abs(0-M) ε12=M
ε24= Abs(f24-u24) ε24=Abs(0-6) ε24=6
ε46= Abs(f46-u46) ε46=Abs(10-M) ε46=M
εmin=6
ε13= Abs(f13-l13) ε13=Abs(10-0) ε13=10
ε35= Abs(f35-l35) ε35=Abs(10-0) ε35=10
ε56= Abs(f56-l56) ε56= Abs(10-0) ε56=10
Nuevo Flujo
π2 π4 f12 0 M 2
f13 0 M 7
6
2 4 f23 0 M 3
f24 0 6 4
6
6
π6 f34 0 3 5
π1
-10 f35 0 M 3
10
6 f45 0 M 2
0
0
1
0
f46 0 M 1
f56 0 M 4
4
4
3 5
4
π3
π5
Prueba de Optimalidad
π2 π4
fij lij uij cij
6 f12 0 M 2
2 4
f13 0 M 7
6
6
π6 f23 0 M 3
π1 f24 0 6 4
10 -10
6 f34 0 3 5
0
0
1
f35 0 M 3
0
f45 0 M 2
f46 0 M 1
4
4
f56 0 M 4
3 5
4
π3 π5
Seleccionamos: π1=0 y seleccionamos los arcos básicos
1-2: C12 – π1 + π2=0 2 – 0 + π2=0 π2= -2
1-3: C13 – π1 + π3=0 7 – 0 + π3=0 π3= -7
3-5: C35 – π3 + π5=0 3 – (-7) + π5=0 π5= -10
4-5: C45 – π4 + π5=0 2 – π4 - 10=0 π4= -8
4-6: C46 – π4 + π6=0 1 – (-8) + π6=0 π6= -9
Costo Reducido de los Arcos No básicos
π2 π4
fij lij uij cij
6 f12 0 M 2
2 4
f13 0 M 7
6
6
π6 f23 0 M 3
π1 f24 0 6 4
10 -10
6 f34 0 3 5
0
0
1
f35 0 M 3
0
f45 0 M 2
f46 0 M 1
4
4
f56 0 M 4
3 5
4
π3 π5
f13 0 M 7
ε
6+
6
π6 f23 0 M 3
π1 f24 0 6 4
10 -10
f34 0 3 5
0+ε
0
1
f35 0 M 3
0
f45 0 M 2
f46 0 M 1
4
4-
ε
f56 0 M 4
3 5
4
π3 π5
π2 π4
6
2 4 fij lij uij cij
f12 0 M 2
10
6
π6 f13 0 M 7
π1
f23 0 M 3
10 -10
6 f24 0 6 4
4
0
1 0
f34 0 3 5
f35 0 M 3
f45 0 M 2
4
0
f46 0 M 1
3 5
f56 0 M 4
4
π3 π5
Prueba de Optimalidad: fij lij uij cij
π2 π4 f12 0 M 2
6 f13 0 M 7
2 4 f23 0 M 3
f24 0 6 4
10
6
π6 f34 0 3 5
π1
-10 f35 0 M 3
10
6 f45 0 M 2
4
0
1
0
f46 0 M 1
f56 0 M 4
4
0
3 5
4
π3 π5
Seleccionamos: π1=0 y seleccionamos los arcos básicos
1-2: C12 – π1 + π2=0 2 – 0 + π2=0 π2= -2
2-3: C23 – π2 + π3=0 3 – (-2) + π3=0 π3= -5
3-5: C35 – π3 + π5=0 3 – (-5) + π5=0 π5= -8
4-5: C56 – π5 + π6=0 4 –(-8) + π6 =0 π6= -12
4-6: C46 – π4 + π6=0 1 – π4 -12 =0 π4= -11
Costo Reducido de los Arcos No básicos: fij lij uij cij
π2 π4 f12 0 M 2
6 f13 0 M 7
2 4 f23 0 M 3
f24 0 6 4
10
6
π6 f34 0 3 5
π1
-10 f35 0 M 3
10
6 f45 0 M 2
4
0
1
0
f46 0 M 1
f56 0 M 4
4
0
3 5
4
π3 π5
π2 π4 f12 0 M 2
6 f13 0 M 7
2 4 f23 0 M 3
f24 0 6 4
10
6+
π6
ε
π1 f34 0 3 5
-10 f35 0 M 3
10
6 f45 0 M 2
4
0
1
ε
0+
f46 0 M 1
f56 0 M 4
ε
4-
0
3 5
4-ε
π3 π5
π2 π4 f12 0 M 2
6 f13 0 M 7
2 4 f23 0 M 3
f24 0 6 4
10
9
π6 f34 0 3 5
π1
10 f35 0 M 3
-10
6 f45 0 M 2
4
0
1 3
f46 0 M 1
f56 0 M 4
1
0
3 5
1
π3 π5
Prueba de Optimalidad:
π2 π4
6 fij lij uij cij
2 4
f12 0 M 2
f13 0 M 7
10
9
π6
π1 f23 0 M 3
10
-10 f24 0 6 4
6
f34 0 3 5
4
0
1
3
f35 0 M 3
f45 0 M 2
1
f46 0 M 1
0
f56 0 M 4
3 5
1
π3 π5
Seleccionamos: π1=0 y seleccionamos los arcos básicos
1-2: C12 – π1 + π2=0 2 – 0 + π2=0 π2= -2
2-3: C23 – π2 + π3=0 3 – (-2) + π3=0 π3= -5
3-5: C35 – π3 + π5=0 3 – (-5) + π5=0 π5= -8
4-5: C56 – π5 + π6=0 4 –(-8) + π6 =0 π6= -12
4-6: C46 – π4 + π6=0 1 – π4 -12 =0 π4= -11
Costo Reducido de los Arcos No básicos:
π2 π4
6 fij lij uij cij
2 4
f12 0 M 2
f13 0 M 7
10
9
π6
π1 f23 0 M 3
10
-10 f24 0 6 4
6
f34 0 3 5
4
0
1
3
f35 0 M 3
f45 0 M 2
1
f46 0 M 1
0
f56 0 M 4
3 5
1
π3 π5
Solución Optima