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/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Shortest Path Problem In Interval Valued Trapezoidal And Triangular Neutrosophic Environment 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.
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
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 On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application
In this article, inaugurate interval-valued triangular neutrosophic fuzzy graph (IVTNFG) of SPP, which is drew on three-sided numbers and IVTNFG. Hear a genuine application is given an illustrative model for IVTNFG. Additionally Shortest way is determined for this model. This present Dijkstra's Algorithm briefest way was checked through Python Jupiter Notebook (adaptation) programming.
Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm
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.