Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis

Authors

Florentin Smarandache, University of New MexicoFollow
Said BroumiFollow
Deivanayagampillai Nagarajan
Malayalan Lathamaheswari
Mohamed Talea
Assia Bakali

Document Type

Article

Publication Date

8-2020

Abstract

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 been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties. These properties provide important theoretical base of the trapezoidal interval valued neutrosophic number. Also, they proposed an intelligent algorithm called trapezoidal interval valued neutrosophic version of Bellman’s algorithm to solve neutrosophic shortest path problem in network analysis. Further, comparative analysis has been made with the existing algorithm.

Publisher

Nova Techset Pvt. Ltd.

Publication Title

CAAI Transactions on Intelligence Technology

ISSN

2468-2322

First Page

1

Last Page

7

DOI

doi: 10.1049/trit.2019.0086

Language (ISO)

English

Keywords

shortest path problems, network analysis, intelligent algorithm, neutrosophic network analysis

Recommended Citation

Smarandache, Florentin; Said Broumi; Deivanayagampillai Nagarajan; Malayalan Lathamaheswari; Mohamed Talea; and Assia Bakali. "Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis." CAAI Transactions on Intelligence Technology (2020): 1-7. doi:doi: 10.1049/trit.2019.0086.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.