Scribd
Upload
42 views

Assignment or

The document describes using Dijkstra's algorithm and the k-shortest path algorithm to find the shortest paths in a transport network of Bhimsen Gaupalika in Gorkha District, Nepal. Dijkstra's algorithm finds the single shortest path between nodes, while the k-shortest path algorithm finds the k shortest paths. The algorithms were used to find the 10 shortest paths and total lengths between 93 nodes. Individual links were removed to determine the critical path with the highest increased total path length.

Uploaded by

Ajeya Acharya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
42 views

Assignment or

The document describes using Dijkstra's algorithm and the k-shortest path algorithm to find the shortest paths in a transport network of Bhimsen Gaupalika in Gorkha District, Nepal. Dijkstra's algorithm finds the single shortest path between nodes, while the k-shortest path algorithm finds the k shortest paths. The algorithms were used to find the 10 shortest paths and total lengths between 93 nodes. Individual links were removed to determine the critical path with the highest increased total path length.

Uploaded by

Ajeya Acharya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

AJEYA ACHARYA 073MSTR252

We were provided the transport network of Bhimsen Gaupalika of Gorkha District.Then we


have to find the shortest path of the network. We used 2 algorithms namely, Dijkstra's algorithm
and k shortest path algorithm to find the shortest path. Short description of both algorithm is given
as below:
Dijkstra's algorithm : Algorithm for finding the shortest paths between nodes in a graph, which
may represent, for example, road networks. It was conceived by computer scientist Edsger W.
Dijkstra in 1956 and published three years later. The algorithm exists in many variants; Dijkstra's
original variant found the shortest path between two nodes, but a more common variant fixes a
single node as the "source" node and finds shortest paths from the source to all other nodes in
the graph, producing a shortest-path tree.

K-Shortest Path algorithm: The algorithm can be broken down into two parts, determining the first
k-shortest path, Ak, and then determining all other k-shortest paths. It is assumed that the
container A will hold k-shortest paths, whereas the container B, will hold the potential k-shortest
paths. To determine A1, the shortest path from the source to the destination, any efficient shortest
path algorithm can be used. To find Ak, where k ranges from 2 to K, the algorithm assumes that
all the paths from A1 to Ak-1 have previously been found. The k iterations can be divided into two
processes, finding all the deviations Aki and choosing a minimum length path to become Ak,
where iteration ranges from 1 to Qkk. The successive shortest paths are removed from container
B and inserted into container A and algorithm continues to thee next iteration. If the amount of
paths in container B equal or exceed the amount of k-shortest paths that still need to be found,
then necessary paths of container B are added to container A and the algorithm is finished.

By using these algorithm, we find the shortest path between 93 nodes of Bhimsen Gaupalika of
Gorkha District .We find 10 shortest path between every origin and destination and the sum of
their length using MATLAB. Every student were assigned different link to determine shortest
path.In my case,5 link were assigned. Then at a time a link was removed from the network and
code was run to find sum of shortest path. After all the computation, distance were compared and
the critical path was found out.

Deleted link no:

Link no Origin Destination Length


100 11 145 1.860841
193 11 146 2.215
54 20 115 2.242756
132 24 116 1.323029
58 26 117 2.694497
101 27 101 0.428

You might also like