Share

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.

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Download The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment PDF Online Free

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

GET EBOOK


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

Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers

Download Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers PDF Online Free

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

GET EBOOK


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

Neutrosophic Shortest Path Problem

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.

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm

Download Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm PDF Online Free

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

GET EBOOK


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

You may also like...