Read Books Online and Download eBooks, EPub, PDF, Mobi, Kindle, Text Full Free.
Research On The Shortest Path Solution Method Of Interval Valued Neutrosophic Graphs Based On The Ant Colony Algorithm
Download Research On The Shortest Path Solution Method Of Interval Valued Neutrosophic Graphs Based On The Ant Colony Algorithm full books in PDF, epub, and Kindle. Read online Research On The Shortest Path Solution Method Of Interval Valued Neutrosophic Graphs Based On The Ant Colony Algorithm ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Book Synopsis Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm by : Lehua Yang
Download or read book Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm written by Lehua Yang and published by Infinite Study. This book was released on with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
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 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 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. In uncertain environments, the neutrosophic number can more effectively express the edge distance.
Book Synopsis A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems by : Ranjan Kumar
Download or read book A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems written by Ranjan Kumar and published by Infinite Study. This book was released on with total page 16 pages. Available in PDF, EPUB and Kindle. Book excerpt: Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely different applications in real world eventualities. However, the uncertainty related to the inconsistent information and indeterminate information isn't properly expressed by fuzzy set. The neutrosophic set deals these forms of uncertainty. This paper presents a model for shortest path problem with various arrangements of integer-valued trapezoidal neutrosophic (INVTpNS) and integer-valued triangular neutrosophic (INVTrNS). We characterized this issue as Neutrosophic Shortest way problem (NSSPP). The established linear programming (LP) model solves the classical SPP that consists of crisp parameters. To the simplest of our data, there's no multi objective applied mathematics approach in literature for finding the Neutrosophic shortest path problem (NSSPP).
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 Intelligent algorithm for trapezoidal interval Q1 valued neutrosophic network analysis by : Said Broumi
Download or read book Intelligent algorithm for trapezoidal interval Q1 valued neutrosophic network analysis 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: The shortest path problem has been one of the most fundamental practical problems in network analysis. One of the good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties.
Book Synopsis Interval-Valued Neutrosophic Competition Graphs by : Muhammad Akram
Download or read book Interval-Valued Neutrosophic Competition Graphs written by Muhammad Akram and published by Infinite Study. This book was released on with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt: We first introduce the concept of interval-valued neutrosophic competition graphs. We then discuss certain types, including k-competition interval-valued neutrosophic graphs, p-competition interval-valued neutrosophic graphs and m-step interval-valued neutrosophic competition graphs. Moreover, we present the concept of m-step interval-valued neutrosophic neighbouhood graphs.
Book Synopsis Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph by : Siddhartha Sankar Biswas
Download or read book Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph written by Siddhartha Sankar Biswas and published by Infinite Study. This book was released on with total page 12 pages. Available in PDF, EPUB and Kindle. Book excerpt: One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but into a Multigraphs model. The Multigraph is a topological generalization of the graph where multiple links (or edges/arcs) mayexist between two nodes unlike in graph.
Book Synopsis On Strong Interval Valued Neutrosophic Graphs by : Said Broumi
Download or read book On Strong Interval Valued Neutrosophic Graphs written by Said Broumi and published by Infinite Study. This book was released on with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we discuss a subclass of interval valued neutrosophic graphs called strong interval valued neutrosophic graphs, which were introduced by Broumi et al. [41]. The operations of Cartesian product, composition, union and join of two strong interval valued neutrosophic graphs are defined. Some propositions involving strong interval valued neutrosophic graphs are stated and proved.
Book Synopsis Estimation of Shortest Path Using Dynamic Programming Through Neutrosophic Environment by : N. Jose Parvin Praveena
Download or read book Estimation of Shortest Path Using Dynamic Programming Through Neutrosophic Environment written by N. Jose Parvin Praveena and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Operations on Interval Valued Neutrosophic Graphs by : BROUMI, S.
Download or read book Operations on Interval Valued Neutrosophic Graphs written by BROUMI, S. and published by Infinite Study. This book was released on with total page 24 pages. Available in PDF, EPUB and Kindle. Book excerpt: Combining the single valued neutrosophic set with graph theory, a new graph model emerges, called single valued neutrosophic graph.
Book Synopsis Shortest Path Problem on Single Valued Neutrosophic Graphs by : Said Broumi
Download or read book Shortest Path Problem on Single Valued Neutrosophic Graphs written by Said Broumi and published by Infinite Study. This book was released on with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs.
Book Synopsis Introduction of some new results on intervalvalued neutrosophic graphs by : Said Broumi
Download or read book Introduction of some new results on intervalvalued neutrosophic graphs written by Said Broumi and published by Infinite Study. This book was released on with total page 25 pages. Available in PDF, EPUB and Kindle. Book excerpt:
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 SELF-CENTERED INTERVAL VALUED NEUTROSOPHIC GRAPH by : V.J. Sudhakar
Download or read book SELF-CENTERED INTERVAL VALUED NEUTROSOPHIC GRAPH written by V.J. Sudhakar and published by Infinite Study. This book was released on with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we discuss the concepts of interval valued neutrosophic gragh, single valued neutrosophic signed graph, self centered single valued neutrosophic graph. We present the concept of self-centered interval valued netrosophic graph. We investigate some properties of self-centered interval valued neutrosophic graphs.
