1. Bellman, R. (1957). Dynamic Programming, Princeton University Press, Princeton, NJ.

2. Dijksta, E. W. (1959). A Note on Two Problems in Connection with Graphs, Numeriche

Mathematik, 1, 269-271.
3. Zhan, F. B., and Noon, C. E. (1996). Shortest Path Algorithms: An Evaluation Using
Real Road Networks. Transportation Science, 32, 65-73.
4. Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1990) faster algorithms for the shortest
path problem. JACM 37(2):213223
5. Cherkassky BV, Goldberg AV, Radzik T (1996) shortest paths algorithms: theory and
experimental evaluation. Math Program 73:129174
6. Farrukh, S and Shah, MAA (2009). Evaluation of Shortest Paths in Road Network
7. Floyd, R. W. (1962). Algorithm 97: Shortest path. Communications of the ACM,Volume
5 No 6.
8. I. Beker, V. Jevtic and D. Dobrilovic, Using shortest-path algorithms for forklift route
planning and optimization. XV International scientific conference on industrial systems,
pp 285-290, September, 14th-16th Novi Sad, Serbia, 2011.
9. I. Beker, V. Jevtic and D. Dobrilovic, Shortest-path algorithms as a tools for inner
transportation optimization. International Journal of Industrial Engineering and
Management (IJIEM), Vol.3 No 1, 2012, pp. 39-45