Computation of shortest path problem in a network with SV-trapezoidal neutrosophic numbers

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 consider...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Advanced Mechatronic Systems pp. 417 - 422
Main Authors Broumi, Said, Bakali, Assia, Talea, Mohamed, Smarandache, Florentin, Vladareanu, Luige
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2016
Subjects
Decision making
Fuzzy sets
Information processing
Network
Score function
Shortest path problem
Single valued trapezoidal neutrosophic number
Transportation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2325-0690
DOI:10.1109/ICAMechS.2016.7813484