Vendedor viajero
Carlitos ReyesEnsayo17 de Junio de 2016
411 Palabras (2 Páginas)159 Visitas
Problema del vendedor Viajero para 7 ciudades
Carlos Reyes Valderrama.
En primera instancia tenemos:
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
1 | 0 | x12 | x13 | x14 | x15 | x16 | x17 |
2 | x21 | 0 | x23 | x24 | x25 | x26 | x27 |
3 | x31 | x32 | 0 | x34 | x35 | x36 | x37 |
4 | x41 | x42 | x43 | 0 | x45 | x46 | x47 |
5 | x51 | x52 | x53 | x54 | 0 | x56 | x57 |
6 | x61 | x62 | x63 | x64 | x65 | 0 | x67 |
7 | x71 | x72 | x73 | x74 | x75 | x76 | 0 |
[pic 1] | |||||
[pic 2] | [pic 3] | ||||
[pic 4] | |||||
[pic 5] | |||||
[pic 6] | [pic 7] | ||||
x12 + x13 + x14 + x15 + x16 + x17 = 1
x21 + x23 + x24 + x25 + x26 + x27 = 1
x31 + x32 + x34 + x35 + x36 + 317 = 1
x41 + x42 + x43 + x45 + x46 + x47 = 1
x51 + x52 + x53 + x54 + x56 + x57 = 1
x61 + x62 + x63 + x64 + x65 + x67 = 1
x71 + x72 + x73 + x74 + x75 + x76 = 1
x21 + x31 + x41 + x51 + x61 + x71 = 1
x12 + x32 + x42 + x52 + x62 + x72 = 1
x13 + x23 + x43 + x53 + x63 + x73 = 1
x14 + x24 + x34+ x54 + x64 + x74 = 1
x15 + x25 + x35 + x45 + x65 + x75 = 1
x16 + x26 + x36 + x46 + x56 + x76 = 1
x17 + x27 + x37 + x47 + x57 + x67 = 1
u2 - u3 + 7 x23 <= 6
u2 - u4 + 7 x24 <= 6
u2 - u5 + 7 x25 <= 6
u2 – u6 + 7x26 <= 6
u2 – u7 + 7x27 <= 6
u3 - u2 + 7 x32 <= 6
u3 - u4 + 7 x34 <= 6
u3 - u5 + 7 x35 <= 6
u3 – u6 + 7 x36 <= 6
u3 – u7 + 7 x37 <= 6
u4 - u2 + 7 x42 <= 6
...