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 full books in PDF, epub, and Kindle. Read online free The Shortest Path Problem In Interval Valued Trapezoidal And Triangular Neutrosophic Environment ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!

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

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Author :
Publisher : Infinite Study
Total Pages : 14
Release :
ISBN-10 :
ISBN-13 :
Rating : 4/5 ( Downloads)

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.


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

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Language: en
Pages: 14
Authors: Said Broumi
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval value
Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm
Language: en
Pages: 9
Authors: S. Krishna Prabha
Categories: Mathematics
Type: BOOK - Published: 2020-10-01 - Publisher: Infinite Study

DOWNLOAD EBOOK

Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s,
Shortest Path Problem Under Interval Valued Neutrosophic Setting
Language: en
Pages: 7
Authors: Said Broumi
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest pa
Shortest path problem using Bellman algorithm under neutrosophic environment
Language: en
Pages: 8
Authors: Said Broumi
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

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
Intelligent algorithm for trapezoidal interval Q1 valued neutrosophic network analysis
Language: en
Pages: 7
Authors: Said Broumi
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

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 bee