A Novel Method for Solving the Time-Dependent Shortest Path Problem under Bipolar Neutrosophic Fuzzy Arc Values

被引：0
|
作者：
Vidhya, K. [1 ]
Saraswathi, A. [1 ]
Said, Broumi [2 ]
机构：
[1] Department of Mathematics, SRM Institute of Science and Technology, Kattankulathur, TamilNadu, Chengalpattu,603203, India
[2] Faculty of Science Ben MSik, University Hassan II, Casablanca, Morocco
来源：
Neutrosophic Sets and Systems | 2024年 / 65卷
关键词：
Bellman-Ford algorithms - Bipolar neutrosophic fuzzy arc weight - Daily lives - Fuzzy numbers - Novel methods - Shortest path problem - Time-dependent short path problem - Time-dependent shortest paths - Uncertainty;
D O I：
10.5281/zenodo.10795555
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：80 / 100
相关论文
共 50 条
  • [31] Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
    Mani Parimala
    Said Broumi
    Karthikeyan Prakash
    Selçuk Topal
    Complex & Intelligent Systems, 2021, 7 : 2373 - 2381
  • [32] A novel Hybrid ant colony algorithm for solving the shortest path problems with mixed fuzzy arc weights
    Alhousrya, Obaida
    Bennagi, Aseel
    Cotfas, Petru A.
    Cotfas, Daniel T.
    ALEXANDRIA ENGINEERING JOURNAL, 2024, 109 : 841 - 855
  • [33] Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem
    Xie, Zhi-ying
    He, Yuan-Rong
    Jiang, Yuan-tong
    Chen, Chih-Cheng
    SCIENTIFIC PROGRAMMING, 2021, 2021
  • [34] A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem
    He, Edward
    Boland, Natashia
    Nemhauser, George
    Savelsbergh, Martin
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 289 - 297
  • [35] Scenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem
    Lu, Ying
    Josse, Gregor
    Emrich, Tobias
    Demiryurek, Ugur
    Renz, Matthias
    Shahabi, Cyrus
    Schubert, Matthias
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 487 - 496
  • [36] Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
    Parimala, Mani
    Broumi, Said
    Prakash, Karthikeyan
    Topal, Selcuk
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (05) : 2373 - 2381
  • [37] A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
    Zheng, Maosheng
    Yu, Jie
    TEHNICKI GLASNIK-TECHNICAL JOURNAL, 2023, 17 (04): : 497 - 500
  • [38] A novel approach for solving all-pairs shortest path problem in an interval-valued fuzzy network
    Enayattabr, M.
    Ebrahimnejad, A.
    Motameni, H.
    Garg, H.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 37 (05) : 6865 - 6877
  • [39] An Improved Ant Colony Algorithm for Solving Time-Dependent Road Network Path Planning Problem
    He Fa-mei
    Xu Yi-na
    Wang Xu-ren
    Xiong Meng-bo
    Xiong Zi-han
    2019 6TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE 2019), 2019, : 126 - 130
  • [40] Solving the fuzzy shortest path problem using multi-criteria decision method based on vague similarity measure
    Dou, Yaling
    Zhu, Lichun
    Wang, Ho Simon
    APPLIED SOFT COMPUTING, 2012, 12 (06) : 1621 - 1631
12345