文章基本信息

标题：Analysis of Optimal Route Algorithms Under Constraint Conditions
本地全文：下载
作者：M.V.Mawale ; Y.B.Gandole
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2011
卷号：2
期号：6
页码：2614-2619
出版社：TechScience Publications
摘要：The shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. Clearly, the choice of shortest-path algorithm for a particular problem will involve complex tradeoffs between flexibility, scalability, performance, and implementation complexity. The comparison made by us developed provides a basis for evaluating these tradeoffs. It was found that although factoring in this optimization to larger degrees did lead to significant imperfections, a balanced level was located where not only were perfect or near-perfect paths were found, but they were also found in the shortest time. the paper analyses the existing optimal route algorithms on a specific problem under constraint conditions with optimal factors based on the Dijkstra algorithm, Bellman Ford Algorithms and A* Algorithms. The paper also gives a method of the algorithm design in detail, and analyses of its time complexity and space complexity.
关键词：Optimal Route; Dijkstra algorithm; Bellman Ford;Algorithms; A* Algorithms.