9. Anexos.

More documents

Recommendations

Info

NodosAdy(Vector(j).Destino).numero = NodosAdy(Vector(j).Destino).numero + 1 ReDim Preserve NodosAdy(Vector(j).Destino).Mady(NodosAdy(Vector(j).Destino).numero) NodosAdy(Vector(j).Destino).Mady(NodosAdy(Vector(j).Destino).numero).Nodo = Vector(j).Origen If CalcularPosicion = True Then NodosAdy(Vector(j).Origen).Mady(NodosAdy(Vector(j).Origen).numero).Posicion = j NodosAdy(Vector(j).Destino).Mady(NodosAdy(Vector(j).Destino).numero).Posicion = j End If Next End Sub Sub Dijkstra(ByVal Origen As Long, ByVal NumeroNodos As Long, ByRef D() As Single) Dim i As Integer, j As Integer Inicializa_Matrices Origen, NumeroNodos, D() For i = 1 To UBound(Mat_C) j = Elige_Menor(Origen) Iteracion_Algoritmo j, Origen, D() Next End Sub Sub Inicializa_Matrices(ByVal Origen As Long, ByVal NumeroNodos As Long, ByRef D() As Single) Dim l As Long Dim i As Integer, j As Integer, k As Integer ReDim Mat_C(NumeroNodos - 1) i = 1 j = 1 While i
j = j + 1 Wend ReDim Mat_L(NumeroNodos - 1) For i = 1 To UBound(Mat_L()) Mat_L(i).Valor = D(Origen, Mat_C(i), 1) Mat_L(i).Visto = False For j = 1 To NodosAdy(Mat_C(i)).numero For k = 1 To NodosAdy(NodosAdy(Mat_C(i)).Mady(j).Nodo).numero If NodosAdy(NodosAdy(Mat_C(i)).Mady(j).Nodo).Mady(k).Nodo = Mat_C(i) Then NodosAdy(NodosAdy(Mat_C(i)).Mady(j).Nodo).Mady(k).Posicion = i End If Next k Next j Next i End Sub Function Elige_Menor(ByVal Origen As Long) As Long Dim i As Long Dim Minimo As Double Minimo = Exp(23) For i = 1 To UBound(Mat_L) If Mat_L(i).Visto = False And Mat_L(i).Valor < Minimo Then Minimo = Mat_L(i).Valor Elige_Menor = i End If Next Mat_L(Elige_Menor).Visto = True End Function Sub Iteracion_Algoritmo(ByVal Pos As Integer, ByVal Origen As Integer, ByRef D() As Single) Dim i As Integer Dim A As Integer, B As Double, C As Double For i = 1 To NodosAdy(Mat_C(Pos)).numero A = NodosAdy(Mat_C(Pos)).Mady(i).Nodo If A 0 Then <strong>Anexos</strong>. 37
Page 1 and 2: 9. Anexos. 9.1. Anexo A: La optimiz
Page 3 and 4: steinb6.txt 6 12 1 9 36 1 10 17 1 1
Page 5 and 6: X j , N − X N , j= { 1 if j∈T
Page 7 and 8: ∂ c1 ∂ c 1 ∂ x 1 ∂c 2 ∂ x
Page 9 and 10: obliga a usar algoritmos del tipo m
Page 11 and 12: %Vector -> Array (Vx3) con arcos no
Page 13 and 14: Código. Preparación de las restri
Page 15 and 16: end DCeq(i,i)=Xij(i+size(Xij,1)/2);
Page 17 and 18: Nodo Inicial VectorDir Nodo Final C
Page 19 and 20: Anexos. viceversa. Esto es así deb
Page 21 and 22: CN XM 1 2 3 4 5 6 7 8 9 10 11 12 13
Page 23 and 24: Constraints Number of nonlinear ine
Page 25 and 26: Anexos. que dependerá del tipo de
Page 27 and 28: Dim TiempoSol As Single Dim Iteraci
Page 29 and 30: For i = 2 To UBound(Entrada()) Busc
Page 31 and 32: Esta1 = False Esta2 = False j = 1 W
Page 33 and 34: Eliminar = False End If Next k End
Page 35: Else End If Origen = Origen + 1 Ori
Page 39 and 40: Wend AnadirArco Vector, Solucion, O
Page 41 and 42: CosteTotal = CosteTotal + Vector(So
Page 43 and 44: indic = 1 ReDim Xij0(UBound(Solucio
Page 45 and 46: If bFileExists(sFile) = True Then O
Page 47 and 48: Else ReDim ListaArchivos(UBound(Aux
Page 49 and 50: .Columns.AutoFit Next i .Columns.Au
Page 51: Public Vector() As Reg_Arcos Public

9. Anexos.

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?