Dijkstra’s Algorithm Project

MATH261 OPERATION RESEARCH

By Emilio Chahine | Nabih Bassil | Mustapha Tom | Jean-Paul Chami | Math261 | 25-4-2108

PAGE 1
Dijkstra’s Algorithm

PAGE 2
 Dijkstra’s Algorithm was created in 1959 by Dutch computer scientist
Edsger Dijkstra. While employed at the Mathematical Centre in
Amsterdam, Dijkstra was asked to demonstrate the powers of ARMAC,
a sophisticated computer system developed by the Mathematical Centre.
Part of his presentation involved illustrating the best way to travel
between two points and in doing so, the shortest path algorithm was
created. It was later renamed Dijkstra’s Algorithm in recognition of its
creator. Dijkstra’s Algorithm is a graph search algorithm that solves the
single-source shortest path problem for a graph with nonnegative edge
path costs, producing a shortest path tree. This algorithm is often used
in routing and other network related protocols. For a given source vertex
(node) in the graph, the algorithm finds the path with lowest cost (i.e.
the shortest path) between that vertex and every other vertex. It can also
be used for finding costs of shortest paths from a single vertex to a single
destination vertex by stopping the algorithm once the shortest path to
the destination vertex has been determined. For example, if the vertices
of the graph represent cities and edge path costs represent driving
distances between pairs of cities connected by a direct road, Dijkstra's
algorithm can be used to find the shortest route between one city and
all other cities.

PAGE 3
PAGE 4
The following project is about finding the shortest path between
Balamand and all Liban-post branches in the North of Lebanon using
the Dijkstra’s Algorithm. The values are real data taken in the unit of
km. Furthermore, some values are rounded for easier calculations. The
following project is presented to Dr Micheline Dib.

This is the following network:

PAGE 5
 NODE LABEL STATUS
BALAMAND(1) [0,-] P
BATROUN(2) [17,1] P
AMIOUN(3) [8,1] P
TRIPOLI mina(4) [10,1] P
TRIPOLI Abou samra(5) [9,1] P
SERAAL(6) [17,3] P
ZGHARTA(7) [29,6] P
HASROUN(8) [25,6] P
BCHARRE(9) [27,6] P
TRIPOLI sheet l nour(10) [10,5] p

From BALAMAND To BATROUN:

(2)-[17,1]-(1) 1  2 = 17 KM

From BALAMAND TO AMIOUN:

(3)-[8,1]-(1) 13 = 8 KM

From BALAMAND TO TRIPOLI mina:

(4)-[10,1]-(1) 14 = 8 KM

From BALAMAND TO TRIPOLI Abou samra:

(5)-[9,1]-(1) 15 = 9 KM

From BALAMAND TO SERAAL:

(6)-[17,3]-(3)-[8,1]-(!) 136 = 8+9 = 17 KM

From BALAMAND TO ZGHARTA:

PAGE 6
(7)-[29,6]-(6)-[17,3]-(3)-[8,1]-(1) 1367 = 8+9+12 = 29 KM

From BALAMAND TO HASSROUN:

(8)-[25,6]-(6)-[17,3]-(3)-[8,1]- (1) 1368 = 8+9+8 = 25 KM

From BALAMAND TO BCHARRE:

(9)-[27,6]-(6)-[17,5]-(3)-[8,1]-(1) 1369 = 27 KM

From BALAMAND TO TRIPOLI Sahat l nour:

(10)-[10,5]-(5)-[9,1]-(1) 1510 = 9+1 = 10 KM

The following Network was solved using Dijkstra’s Algorithm :

PAGE 7
 References

http://portal.unimap.edu.my/portal/page/portal30/Lecturer%20Notes/
KEJURUTERAAN_KOMPUTER/Semester%202%20Sidang%20Akademi
k%2020112012/EKT332%20Computer%20Network/LECTURE%20NOTE
S/Dijkstra_Algo.pdf

https://www.draw.io/

PAGE 8