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

被引：0
|
作者：
Said Broumi
Deivanayagampillai Nagarajan
Assia Bakali
Mohamed Talea
Florentin Smarandache
Malayalan Lathamaheswari
机构：
[1] Faculty of Science Ben M’Sik,Laboratory of Information Processing
[2] University Hassan II,Department of Mathematics
[3] Ecole Royale Navale,Department of Mathematics
[4] University of New Mexico,undefined
[5] Hindustan Institute of Technology and Science,undefined
来源：
Complex & Intelligent Systems | 2019年 / 5卷
关键词：
Interval valued triangular neutrosophic number; Interval valued trapezoidal neutrosophic number; Ranking methods; Deneutrosophication; Neutrosophic shortest path problem; Network;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：391 / 402
页数：11
相关论文
共 50 条
  • [1] The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
    Broumi, Said
    Nagarajan, Deivanayagampillai
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    Lathamaheswari, Malayalan
    COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (04) : 391 - 402
  • [2] Application of Dijkstra Algorithm for Solving Interval Valued Neutrosophic Shortest Path Problem
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    PROCEEDINGS OF 2016 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2016,
  • [3] Shortest Path Problem on Single Valued Neutrosophic Graphs
    Broumi, Said
    Talea, Mohamed
    Bakali, Assia
    Smarandache, Florentin
    Kumar, Kishore P. K.
    2017 INTERNATIONAL SYMPOSIUM ON NETWORKS, COMPUTERS AND COMMUNICATIONS (ISNCC), 2017,
  • [4] Algorithm for Shortest Path Problem in a Network with Interval-valued Intuitionistic Trapezoidal Fuzzy Number
    Kumar, Gaurav
    Bajaj, Rakesh Kumar
    Gandotra, Neeraj
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON ECO-FRIENDLY COMPUTING AND COMMUNICATION SYSTEMS, 2015, 70 : 123 - 129
  • [5] Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    PROCEEDINGS OF 2016 10TH INTERNATIONAL CONFERENCE ON SOFTWARE, KNOWLEDGE, INFORMATION MANAGEMENT & APPLICATIONS (SKIMA), 2016, : 169 - 174
  • [6] Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    Vladareanu, Luige
    2016 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2016, : 417 - 422
  • [7] Neutrosophic Shortest Path Problem
    Kumar, Ranjan
    Edaltpanah, S. A.
    Jha, Sripati
    Broumi, Said
    Dey, Arindam
    NEUTROSOPHIC SETS AND SYSTEMS, 2018, 23 : 5 - 15
  • [8] A Novel Method for Neutrosophic Assignment Problem by using Interval-Valued Trapezoidal Neutrosophic Number
    Khalifa H.A.E.-W.
    Kumar A.P.
    Neutrosophic Sets and Systems, 2020, 36 : 24 - 36
  • [9] Study on single-valued neutrosophic graph with application in shortest path problem
    Liu, Ruxiang
    CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY, 2020, 5 (04) : 308 - 313
  • [10] Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
    Enayattabar, Mohammad
    Ebrahimnejad, Ali
    Motameni, Homayun
    COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (02) : 93 - 100
12345