Algorithms for Finding Shortest Route Network Problem
Abstract
A shortest-path algorithm finds a way containing the negligible cost between two vertices in a diagram, A plenty of most brief way calculations is examined in the writing that range over numerous orders. most brief way calculations in light of a scientific categorization that is presented in the paper. One measurement of this scientific categorization is the different favors of the shorts way issue. There is nobody general calculation that is fit for understanding all variations of the most limited way issue because of the space and time complexities related with every calculation. Other essential measurements of the scientific classification incorporate whether the most limited way calculation works over a static or a dynamic diagram, regardless of whether the briefest way calculation produces correct or surmised answers, and whether the goal of the most brief way calculation is to accomplish time-reliance or is to just be objective coordinated.
Downloads
References
2. Kenneth H. Rosen Discrete Mathematics and Its Applications, 5th Edition. Addison Wesley, 2003, p -490 -500
3. G. B. Dantzig., Linear programming and extensions. Princeton University Press, Princeton, NJ, 1963.
4. Hamdy A. Taha, Operation Research- An Introduction, Prentice Hall, 2007, p 243-257, 349 – 395
5. Kambo N.S., Mathematical Programming Techniques, East-West Press, 1984, p 124-131.
6. Ralph P. Grimaldi Discrete and Combinatorial Mathematics- An Applied Introduction, Pearson Addison Wesley, 200, p 591-6254.
7. Ahuja R. K., Magnanti T. L. and Orlin J. B. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
8. Phillips N., Network Models in Optimization & Their Applications in Practice, Wiley, 1992.
9. Chen, K. M. (2009). A real-time wireless route guidance system for urban traffic management and its performance evaluation.
10. Meghanathan, D. N. (n.d.). Review of Graph Theory Algorithms . MS: Department of Computer Science , Jackson State University
11. Lili Cao, X. Z. (n.d.). Approximating Shortest Path in Social Graph. U.C. Santa Barbara: Computer Science Department
12. Taha, H. (2011). Operations research an introduction, ninth edition. Pearson Publisher. Wadhwa, S. (n.d.). Analysis of a network design problem. 2000: Lehigh University
13. Scutella, S. P. (1997). Technical report on Shortest Path Algorithms in Transportation models, Classical and innovative aspects
14. Ahmat, K. A. (n.d.). Graph Theory and Optimization Problems for Very Large Networks. New York: City University of New York/Information Technology.
15. Goldberg, A. V. (n.d.). Point - to - Point Shortest Path Algorithms with Pre-processing. Silicon Valley:MicrosoftResearch
16. T. Li, Q. a. (2008). An efficient Algorithm for the single source Shortest Path Problem in Graph Theory. International Conference on Intelligent System and Knowledge Engineering, (pp. 152 - 157)
17. Sommer, C. (2010). Approximate Shortest Path and Distance Queries in Networks. Tokyo: Department of Computer Science, Graduate School of Information Science and Technology.
18. U. Zwick. Exact and approximate distances in graphsa survey. ESA, 2001.
19. S. Sen. Approximating shortest paths in graphs. WALCOM: Algorithms and Computation, pages 32–43, 2009.
20. M. Holzer, F. Schulz, D. Wagner, and T. Willhalm. Combining speed-up techniques for shortest-path computations. Journal of Experimental Algorithmics, 2005.
21. L. Fu, D. Sun, and L. Rilett. Heuristic shortest path algorithms for transportation applications: State of the art. Computers & Operations Research, pages 3324–3343, 2006.
22. D. Delling and D. Wagner. Time-dependent route planning. Robust and Online Large-Scale Optimization, 2:1–18, 2009.
Copyright (c) 2019 IJRDO - Journal of Mathematics (ISSN: 2455-9210)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.
