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 条
  • [21] Evaluation of the shortest path based on the Traveling Salesman problem with a genetic algorithm in a neutrosophic environment
    Raut P.K.
    Behera S.P.
    Broumi S.
    Dey A.
    Talea M.
    Baral A.
    Neutrosophic Sets and Systems, 2024, 68 : 187 - 197
  • [22] Application of Single Valued Trapezoidal Neutrosophic Numbers in Transportation Problem
    Saini, Rajesh Kumar
    Sangal, Atul
    Manisha
    Neutrosophic Sets and Systems, 2020, 35 : 563 - 583
  • [23] Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph
    Biswas, Siddhartha Sankar
    NEUTROSOPHIC SETS AND SYSTEMS, 2019, 29 : 174 - 185
  • [24] Mehar Approach for Solving Shortest Path Problems with Interval-Valued Triangular Fuzzy Arc weights
    Thapar Institute of Engineering and Technology, India
    不详
    Int. J. Fuzzy Syst. Appl., 2156, 1
  • [25] Trapezoidal neutrosophic assignment problem with new interval arithmetic costs
    Sinika, S.
    Ramesh, G.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 45 (02) : 2179 - 2191
  • [26] An improved A* search algorithm for the shortest path under interval-valued Pythagorean fuzzy environment
    Vidhya, K.
    Saraswathi, A.
    GRANULAR COMPUTING, 2023, 8 (02) : 241 - 251
  • [27] Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    Vladareanu, Luige
    2016 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2016, : 412 - 416
  • [28] Solving the shortest path problem with interval arcs
    Sengupta A.
    Pal T.K.
    Fuzzy Optimization and Decision Making, 2006, 5 (1) : 71 - 89
  • [29] Multi-objective Production Planning Problem: Interval-valued Trapezoidal Neutrosophic and Multi-Choice Parameters
    Haq, Ahteshamul
    Khan, Mohd Arif
    Ahmed, Aquil
    Neutrosophic Sets and Systems, 2022, 50 : 208 - 224
  • [30] An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment
    Vidhya K.
    Saraswathi A.
    Broumi S.
    Neutrosophic Sets and Systems, 2024, 63 : 82 - 94
12345