SHORTEST ROUTE DELIVERY USING DJIKSTRA’S ALGORITHM
Raajitha Sabbineni Sasidhar Varma Gadiraju
Computer Science
SID: 11512515
RaajithaSabbineni@my.unt.edu
INTRODUCTION
Multiple trip routing problem which
can be described as a Vehicle Routing
Problem (VRP). This project builds an
algorithm for drivers and vehicles to
discover the shortest and quickest
path for a multi-point delivery
situation. In this project, the shortest
path problem (SPP) is a static issue in
which the edge weight remains
constant and indicates the length of
the route from point to point.
COMPLETED WORK
There are variety of shortest path
algorithms available like Bellman-
Ford algorithm, Dijkstra’s algorithm,
Floyd-Warshall algorithm, BFS, A*,
Johnson’s algorithm etc. The
algorithm we chose to use in this
project is Dijkstra’s algorithm
because of the advantages it provides
compared to other algorithms.
Computer Science
SID: 11502272
SasidharVarmaGadiraju@my.unt.edu
Dijkstra’s algorithm has the ability to
discover the shortest path from one
node to every other node inside the
graph which sets it apart from other
algorithms. Instead of finding the
shortest path, this algorithm searches
for the shortest way to every single
node as long as the graph remains
unchanged. Bellman-Ford algorithm
works similar to Dijkstra’s to find the
shortest path but the only
disadvantage is it is slower in
performance than Dijkstra’s. When
there are a lot of target nodes, A*
isn't very useful because it has to be
performed numerous times to get all
of them. BFS needs relatively large
memory to store the pointers.
Whereas Johnson’s algorithm relies
on both Bellman-Ford and Dijkstra’s
to determine the shortest path. After
determining which algorithm to use,
the next stage is to assess and select
an adequate dataset for the project.
We chose the dataset by weighing
the project needs against the quality
of the available datasets. Dijkstra's
algorithm and its variants were
investigated. The flow of code
implementation has been designed. It
goes through two stages. The first
step is to determine the shortest
route from the starting location to
the destinations. We determine the
quickest path back to the starting
position in the second stage. The
project code has been started and is
now being implemented.
MILESTONES ACHIEVED
 Determining the right
algorithm for the project based
on its requirements.
 Analyzing and selecting
appropriate dataset for the
project.
 Designing the flow of code
implementation.
 Initiated code implementation.
DIFFICULTIES FACED AND
SOLUTIONS
 Finding the right technical
stack for the project.
 We chose Java as it has
numerous libraries, packages
and open-source tools which
can help us in building the
application.
  Finding right algorithm for
shortest path between the
source and destination.
  We chose Dijkstra’s algorithm
as it has the ability to discover
the shortest path from one
node to every other node
inside the graph which sets it
apart from other algorithms.
REMAINING MILESTONES
 Completion of code
development.
 Comparing the performance
with existing models.
 Optimizing the code to
increase the performance.
 Build test case scenarios and
test the code.
PROJECT PROGRESS CHART
 Testing
Performance evaluation
Code implementation
Design code flow
Dataset selection
Algorithm determination

0 10 20 30 40 50 60 70 80 90 100