REPORT: DEVELOPMENT OF THE SHORTEST ROUTE

Sofía Charry Alvernia

sofiacharryalvernia@javerianacali.edu.co

Nicol Solarte Herrera

nicolsolarte12@javerianacali.edu.co

Department of Civil and Industrial Engineering

Pontificia Universidad Javeriana de Cali
Cali, Colombia
9th April 2019

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

In order to find the shortest rout, a graph was

made, defining 10 nodes located between From E F G
strategic intersections (represented by letters B - 8400 4400
from the alphabet), as it is shown in the map,
C 7300 6700 4300
avoiding both Ciudad de Cali´s avenue and the
stretch between 26th street in Suroriental´s D 8900 7500 -
freeway and its joint with Simon Bolivar´s
avenue . The variables and stages established
are listed bellow, as well as the selected nodes. From H I
E 3700 4300
NODE LOCATION F 4100 -
A CENTRO EMPRESA G - 6700
B 25 Street., CARRERA 8
C 25 street, CARRERA 15
D 1st North avenue From J
E 5 street, end of south-east H 1700
F 14 street with carrera 66 I 3200
G SIMON BOLIVAR Highway, 39 street
H CIUDAD JARDIN´s round point The distance between nodes is shown bellow
I PANAMERICANA in the next graph:
PONTIFICIAUNIVERSIDAD JAVERIANA DE CALI,
J PANCE
 STAGE 1: How to get to J
E1 J X1* f1*
H 1700 H- J 1700
I 3200 I-J 3200
STAGE 2: How to get to I and H
X2
E2 X2* f2*
H I
E 5400 7500 E-H 5400
F 5800 - F-H 5800
G - 9900 G-I 9900

STAGE 3: How to get to E, F and G

III. OBJETIVES: E2
X3
X3* f3*
E F G
General objective: Determine the shortest rout, B - 14200 14300 B-F 14200
C 12700 12500 14200 C-F 12500
from Javeriana's headquarters in Centro D 14300 13300 - D-F 13300
Empresa to Pance's headquarters.
STAGE 4: How to get to B, C and D
X4
Define the requiered stages and recursive E2
B C D
X4* f4*
function to solve the algorithm A 22000 18600 19600 A-C 18600

 Locate the needed nodes in strategic
spots
 Establish the appropriate state and
decision variables
IV. PROBLEM SOLUTION
Based on the previous objetive, which is to
minimize the distance between both
headquarters, the following variables were
defined:
State variable (Ei)= Node where i come from
Decision variable (Xi)= following node to arrive
to.
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:
I. CONCLUSION:
According to the obtained results, the optimal
route from
Javeriana's headquarters in Centro Empresa to
Pance's headquarters, involves a 18600 meters
distance, and is constituted by the following
nodes: A, C, F ,H and J, which involves starting
from 25 street, intercepted by carrera 15,
crossing 4th Avenue. Then, the rout continues
with the South-east highway, and turning in
Carrera 66, until reaching 14th street. Later, you
must reach 16th street, in order to get to Carrera
100, to get straight to Cañas Gordas avenue and
finally reach your destination, which is
Pontificia Universidad Javeriana Cali.