Share

Neutrosophic Shortest Path Problem

Mathematics
Download Neutrosophic Shortest Path Problem PDF Online Free

Author :
Release :
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Neutrosophic Shortest Path Problem by : Ranjan Kumar

Download or read book Neutrosophic Shortest Path Problem written by Ranjan Kumar. This book was released on . 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.

Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

2020-10-01 Mathematics
Download Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm PDF Online Free

Author :
Release : 2020-10-01
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


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. This book was released on 2020-10-01. 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.

Shortest Path Problem Under Interval Valued Neutrosophic Setting

Mathematics
Download Shortest Path Problem Under Interval Valued Neutrosophic Setting PDF Online Free

Author :
Release :
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


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. This book was released on . 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.

Shortest path problem using Bellman algorithm under neutrosophic environment

Mathematics
Download Shortest path problem using Bellman algorithm under neutrosophic environment PDF Online Free

Author :
Release :
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


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 . This book was released on . 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.

Shortest Path Problem under Trapezoidal Neutrosophic Information

Download Shortest Path Problem under Trapezoidal Neutrosophic Information PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


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. This book was released on . 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.

You may also like...