Estimation Of Shortest Path Using Dynamic Programming Through Neutrosophic Environment
Download Estimation Of Shortest Path Using Dynamic Programming Through Neutrosophic Environment full books in PDF, epub, and Kindle. Read online free Estimation Of Shortest Path Using Dynamic Programming Through Neutrosophic Environment ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Author | : N. Jose Parvin Praveena |
Publisher | : Infinite Study |
Total Pages | : 7 |
Release | : |
Genre | : Mathematics |
ISBN | : |
This article explains a method to determine the shortest path for an acyclic network. Here the Dynamic Programming method is applied to find the shortest route. The edge weights of the acyclic network are involved in terms of the single valued Neutrosophic set. And besides the edge weights are considered in terms of Interval valued Neutrosophic set. In deneutrosophication score function formula is applied. Applying the proposed method, the shortest path is estimated.
Author | : N. Jose Pravin Praveena |
Publisher | : Infinite Study |
Total Pages | : 5 |
Release | : |
Genre | : Mathematics |
ISBN | : |
This paper proposed a method to find the shortest path in Neutrosophic environment using a dynamic programming algorithm. Applying Triangular, Trapezoidal and Pentagonal Neutrosophic numbers determine the shortest path. The shortest route is estimated for the acyclic network. Furthermore, we compared the results of Neutrosophic numbers and proved that the results are same.
Author | : Said Broumi |
Publisher | : Infinite Study |
Total Pages | : 14 |
Release | : |
Genre | : Mathematics |
ISBN | : |
Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.
Author | : Said Broumi |
Publisher | : Infinite Study |
Total Pages | : 7 |
Release | : |
Genre | : Mathematics |
ISBN | : |
This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.
Author | : Lehua Yang |
Publisher | : Infinite Study |
Total Pages | : 17 |
Release | : |
Genre | : Mathematics |
ISBN | : |
The shortest path problem (SPP) is considerably important in several fields. After typhoons, the resulting damage leads to uncertainty regarding the path weight that can be expressed accurately. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership degrees of the elements. In an uncertain environment, neutrosophic numbers can express the edge distance more effectively.
Author | : Ranjan Kumar |
Publisher | : Infinite Study |
Total Pages | : 11 |
Release | : |
Genre | : Mathematics |
ISBN | : |
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node.
Author | : Said Broumi |
Publisher | : Infinite Study |
Total Pages | : 7 |
Release | : |
Genre | : |
ISBN | : |
In this research paper, a new approach is proposed for computing the shortest path length from source node to destination node in a neutrosophic environment. The edges of the network are assigned by trapezoidal fuzzy neutrosophic numbers. A numerical example is provided to show the performance of the proposed approach.
Author | : K. Kalaiarasi |
Publisher | : Infinite Study |
Total Pages | : 14 |
Release | : |
Genre | : Mathematics |
ISBN | : |
In this article, inaugurate interval-valued triangular neutrosophic fuzzy graph (IVTNFG) of SPP, which is drew on three-sided numbers and IVTNFG. Hear a genuine application is given an illustrative model for IVTNFG. Additionally Shortest way is determined for this model. This present Dijkstra's Algorithm briefest way was checked through Python Jupiter Notebook (adaptation) programming.
Author | : Lehua Yang |
Publisher | : Infinite Study |
Total Pages | : 22 |
Release | : |
Genre | : Mathematics |
ISBN | : |
The shortest path problem is a topic of increasing interest in various scientific fields. The damage to roads and bridges caused by disasters makes traffic routes that can be accurately expressed become indeterminate. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership of the constituent elements. It has a symmetric form and indeterminacy membership is their axis of symmetry. In uncertain environments, the neutrosophic number can more effectively express the edge distance.
Author | : Smarandache, Florentin |
Publisher | : IGI Global |
Total Pages | : 406 |
Release | : 2019-10-25 |
Genre | : Computers |
ISBN | : 1799813150 |
Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.