Read Books Online and Download eBooks, EPub, PDF, Mobi, Kindle, Text Full Free.
Shortest Path Problem Under Trapezoidal Neutrosophic Information
Download Shortest Path Problem Under Trapezoidal Neutrosophic Information full books in PDF, epub, and Kindle. Read online Shortest Path Problem Under Trapezoidal Neutrosophic Information ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Book Synopsis Shortest Path Problem under Trapezoidal Neutrosophic Information by : Said Broumi
Download or read book Shortest Path Problem under Trapezoidal Neutrosophic Information written by Said Broumi and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest Path Problem under Trapezoidal Neutrosophic Information by : Said Broumi
Download or read book Shortest Path Problem under Trapezoidal Neutrosophic Information written by Said Broumi and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
Book Synopsis Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers by : Said Broum
Download or read book Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers written by Said Broum and published by Infinite Study. This book was released on with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate the efficiency of the proposed approach.
Book Synopsis The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment by : Said Broumi
Download or read book The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment written by Said Broumi and published by Infinite Study. This book was released on with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm by : Lehua Yang
Download or read book Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm written by Lehua Yang and published by Infinite Study. This book was released on with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm by : Lehua Yang
Download or read book Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm written by Lehua Yang and published by Infinite Study. This book was released on with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest path on interval-valued nether trapezoidal neutrosophic fuzzy graphs by : K. Kalaiarasi
Download or read book Shortest path on interval-valued nether trapezoidal neutrosophic fuzzy graphs written by K. Kalaiarasi and published by Infinite Study. This book was released on with total page 5 pages. Available in PDF, EPUB and Kindle. Book excerpt: The concept of this research is introduced to interval-valued trapezoidal neutrosophic fuzzy graph which is combined to trapezoidal fuzzy numbers and interval-valued neutrosophic fuzzy graph. In this analysis, proposed algorithm finds source node and destination node because of the shortest path problem. In this research, we apply trapezoidal number with interval-valued neutrosophic fuzzy graph and finding their score function. Eventually an illustrative example to explain, to easy way of shortest path fuzzy graph.
Book Synopsis Neutrosophic Shortest Path Problem by : Ranjan Kumar
Download or read book Neutrosophic Shortest Path Problem written by Ranjan Kumar and published by Infinite Study. This book was released on with total page 11 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm by : S. Krishna Prabha
Download or read book Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm written by S. Krishna Prabha and published by Infinite Study. This book was released on 2020-10-01 with total page 9 pages. Available in PDF, EPUB and Kindle. Book excerpt: Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.
Book Synopsis Shortest Path with Normalized Single Valued Trapezoidal Neutrosophic Numbers by : D. Selvi
Download or read book Shortest Path with Normalized Single Valued Trapezoidal Neutrosophic Numbers written by D. Selvi and published by Infinite Study. This book was released on with total page 12 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper we studied the network with Single Valued Trapezoidal Neutrosophic (SVTN) numbers. We propose an algorithm by transforming single valued trapezoidal neutrosophic (SVTN) numbersinto normalized single valued trapezoidal neutrosophic (NSVTN) numbers and obtain an optimal value of the short path problem using defuzzification and scoring function. Finally, a numerical example is used to illustrate the efficiency of the proposed approach.
Book Synopsis Shortest Path Problem Under Interval Valued Neutrosophic Setting by : Said Broumi
Download or read book Shortest Path Problem Under Interval Valued Neutrosophic Setting written by Said Broumi and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application by : K. Kalaiarasi
Download or read book Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application written by K. Kalaiarasi and published by Infinite Study. This book was released on with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest path problem using Bellman algorithm under neutrosophic environment by : Said Broumi
Download or read book Shortest path problem using Bellman algorithm under neutrosophic environment written by Said Broumi and published by Infinite Study. This book was released on with total page 8 pages. Available in PDF, EPUB and Kindle. Book excerpt: An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.
Book Synopsis Neutrosophic Sets and Systems: An International Book Series in Information Science and Engineering, vol. 24 / 2018 by : Florentin Smarandache
Download or read book Neutrosophic Sets and Systems: An International Book Series in Information Science and Engineering, vol. 24 / 2018 written by Florentin Smarandache and published by Infinite Study. This book was released on with total page 154 pages. Available in PDF, EPUB and Kindle. Book excerpt: “Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc.
Book Synopsis Neutrosophic numbers in finding the shortest path using dynamic programming by : N. Jose Pravin Praveena
Download or read book Neutrosophic numbers in finding the shortest path using dynamic programming written by N. Jose Pravin Praveena and published by Infinite Study. This book was released on with total page 5 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis The shortest path problem on chola period built temples with Dijkstra’s algorithm in intuitionistic triangular neutrosophic fuzzy graph by : K. Kalaiarasi
Download or read book The shortest path problem on chola period built temples with Dijkstra’s algorithm in intuitionistic triangular neutrosophic fuzzy graph written by K. Kalaiarasi and published by Infinite Study. This book was released on 2023-01-01 with total page 21 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this article, Intuitionistic Triangular Neutrosophic Fuzzy Graph of Shortest Path Problem was Inaugurated, which is drew on triangular numbers and Intuitionistic Neutrosophic Fuzzy Graph. Real-world application is given as an illustrative model for Intuitionistic Triangular Neutrosophic Fuzzy Graph. Here we introduced famous chola period temples. These types of temples builted in various king of cholas. Here we assume only seven types of temples as vertices of Intuitionistic Triangular Neutrosophic Fuzzy Graph. Use of fuzzification method, edge weights of this Graph was calculated. Score function of Intuitionistic Triangular Neutrosophic Fuzzy Graph is inaugurated, with the help of this score function in the proposed algorithm, shortest way is determined.. This present Chola period temples Shortest Path Problem. Obtained shortest path is verified through Dijkstra’s Algorithm with the help of Python Jupyter Notebook (adaptation) programming.
Book Synopsis Neutrosophic Graph Theory and Algorithms by : Smarandache, Florentin
Download or read book Neutrosophic Graph Theory and Algorithms written by Smarandache, Florentin and published by IGI Global. This book was released on 2019-10-25 with total page 406 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
