Accès ouvert

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

Article scientifique 2019 Anglais

Résumé

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.

Citer ce document

Broumi, S., Bakali, A., Talea, M., Smarandache, F., Lathamaheswari, M. (2019). The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment. https://doi.org/10.1007/s40747-019-0092-5

Accès au document

Voir sur le dépôt source

Ce document est hébergé sur son dépôt institutionnel d'origine.

Auteur(s)

Said Broumi Assia Bakali Mohamed Talea Florentín Smarandache M. Lathamaheswari

Statistiques

Consultations : 2

Téléchargements : 0