Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
I. INTRODUCTION
The purpose of this report, is to determine the Were (di) represents the distance between nodes
shortest rout from Pontificia Universidad Ei and Xi (in meters), measured by Google
Javeriana´s headquarters in Centro empresa, to maps tools, as it is shown in the following
Pance´s headquarters, using Wagner and Whitin tables:
Algorithm.
From B C D
II. PROBLEM STATEMENT A 7800 6100 6300
I. CONCLUSION:
Locate the needed nodes in strategic
spots According to the obtained results, the optimal
route from
Establish the appropriate state and
decision variables Javeriana's headquarters in Centro Empresa to
Pance's headquarters, involves a 18600 meters
distance, and is constituted by the following
IV. PROBLEM SOLUTION nodes: A, C, F ,H and J, which involves starting
from 25 street, intercepted by carrera 15,
Based on the previous objetive, which is to crossing 4th Avenue. Then, the rout continues
minimize the distance between both
with the South-east highway, and turning in
headquarters, the following variables were
Carrera 66, until reaching 14th street. Later, you
defined:
must reach 16th street, in order to get to Carrera
State variable (Ei)= Node where i come from 100, to get straight to Cañas Gordas avenue and
Decision variable (Xi)= following node to arrive finally reach your destination, which is
to. Pontificia Universidad Javeriana Cali.
Stages: How to get to a node or nodes.
Also, the recursive function is defined bellow:
MIN F(Ei,Xi)= di(Ei,Xi) + f*i-1(Xi)
From this information it was posible to develop
the algorithm on each stage: