CONCLUSION

Shortest path problems are one of the basic problems within Computer Science and specifically
Operations Research and Programming sub-fields respectively. In this paper, we evaluated selected
shortest path algorithms such as Dijkstra; A*-search; restricted search, Bellman-Ford; Floyd- Warshall;
Gallo Pallottino graph growth algorithm, et cetera and eventually selected Dijkstra's SPA implemented
with double bucket data structure due to its fast and robust performance attributes with linear run time
complexity to implement our route guidance application for optimal result. While the A*-search
algorithm is the most popular heuristic algorithms, its computational efficiency in real transportation
networks is bounded by a factor of 2 or 50% saving in computational time as compared to an ordinary
label search algorithm. This application is intended to be deployed in emergency response and logistic
planning

27
 FUTURE ENHANCEMENT

Dijkstra's Algorithm has inspired various variants and enhancements, catering to specific needs and
overcoming limitations. One notable variant is the Bidirectional Dijkstra's Algorithm, which exploits the
symmetry of graphs to achieve faster computations. By performing the algorithm simultaneously from
both the source and destination vertices, this variant can significantly reduce the search space. Another
noteworthy enhancement is the A* Algorithm, which incorporates heuristics to guide the search towards
the destination more efficiently. By considering both the tentative distances and heuristic estimates, the
A* Algorithm strikes a balance between accuracy and computational efficiency. Additionally, the
Bellman-Ford Algorithm handles graphs with negative edge weights, providing an alternative to
Dijkstra's Algorithm in such scenarios.

28
 REFERENCES

[1] Introduction to The Design &Analysis of Algorithms ,AnanyLevitin ,Villanova University

[2]Ahuja, R.K., and Orlin, J.B. "Graph and Network Optimization", Journal of Optimization and Operations
Research, UNESCO-EOLSS, Vol. II, 1993.

[3] Lumsdaine, A., Gregor, D., Hendrickson, B., and Berry, J.W. "Challenges in Parallel Graph Processing".
Parallel Processing Letters Volume 17, No. 5, p.20, 2007.

[4] Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., and Czajkowski, G. Pregel:
A System for 2/10/06, Indianapolis, Indiana, USA, 2010Large-Scale Graph Processing. In proceedings of
SIGMOD’10, ACM 978-1-4503-0032-

29