Shortest Path Problem Under Interval Valued Neutrosophic Setting

Shortest Path Problem Under Interval Valued Neutrosophic Setting
Author :
Publisher : Infinite Study
Total Pages : 7
Release :
ISBN-10 :
ISBN-13 :
Rating : 4/5 ( Downloads)

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.


Shortest Path Problem Under Interval Valued Neutrosophic Setting Related Books

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
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,
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
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
Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
Language: en
Pages: 17
Authors: Lehua Yang
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

The shortest path problem (SPP) is considerably important in several fields. After typhoons, the resulting damage leads to uncertainty regarding the path weight