Neutrosophic Shortest Path Problem
DOWNLOAD
Download Neutrosophic Shortest Path Problem PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Neutrosophic Shortest Path Problem book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Neutrosophic Shortest Path Problem
DOWNLOAD
Author : Ranjan Kumar
language : en
Publisher: Infinite Study
Release Date :
Neutrosophic Shortest Path Problem written by Ranjan Kumar and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with Mathematics categories.
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.
Interval Valued Neutrosophic Shortest Path Problem By A Algorithm
DOWNLOAD
Author : S. Krishna Prabha
language : en
Publisher: Infinite Study
Release Date : 2020-10-01
Interval Valued Neutrosophic Shortest Path Problem By A Algorithm written by S. Krishna Prabha and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020-10-01 with Mathematics categories.
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.
Shortest Path Problem Under Interval Valued Neutrosophic Setting
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
Shortest Path Problem Under Interval Valued Neutrosophic Setting written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
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.
Shortest Path Problem Using Bellman Algorithm Under Neutrosophic Environment
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
Shortest Path Problem Using Bellman Algorithm Under Neutrosophic Environment written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with Mathematics categories.
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.
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network.
The Shortest Path Problem In Interval Valued Trapezoidal And Triangular Neutrosophic Environment
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
The Shortest Path Problem In Interval Valued Trapezoidal And Triangular Neutrosophic Environment written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with Mathematics categories.
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.
Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number.
Computation Of Shortest Path Problem In A Network With Sv Trapezoidal Neutrosophic Numbers
DOWNLOAD
Author : Said Broum
language : en
Publisher: Infinite Study
Release Date :
Computation Of Shortest Path Problem In A Network With Sv Trapezoidal Neutrosophic Numbers written by Said Broum and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
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.
Neutrosophic Shortest Path Problem Nspp In A Directed Multigraph
DOWNLOAD
Author : Siddhartha Sankar Biswas
language : en
Publisher: Infinite Study
Release Date :
Neutrosophic Shortest Path Problem Nspp In A Directed Multigraph written by Siddhartha Sankar Biswas and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with Mathematics categories.
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.
Shortest Path Problem Under Trapezoidal Neutrosophic Information
DOWNLOAD
Author : Said Broumi
language : en
Publisher: Infinite Study
Release Date :
Shortest Path Problem Under Trapezoidal Neutrosophic Information written by Said Broumi and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
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.