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
关键词
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 条
  • [21] A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs
    Vidhya, K.
    Saraswathi, A.
    INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2023, 21
  • [22] The approach-dependent, time-dependent, label-constrained shortest path problem
    Sherali, Hanif D.
    Jeenanunta, Chawalit
    Hobeika, Antoine G.
    NETWORKS, 2006, 48 (02) : 57 - 67
  • [23] A novel lexicographic optimization method for solving shortest path problems with interval-valued triangular fuzzy arc weights
    Ebrahimnejad, Ali
    Tabatabaei, Somayeh
    Santos-Arteaga, Francisco J.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 39 (01) : 1277 - 1287
  • [24] The Shortest Path Problem on a Time-Dependent Network With Mixed Uncertainty of Randomness and Fuzziness
    Huang, Wei
    Wang, Jinsong
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (11) : 3194 - 3204
  • [25] An Improved Ant Colony Algorithm for the Shortest Path Problem in Time-Dependent Networks
    Chang, Qing
    Liu, Yongqiang
    Xiong, Huagang
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2009, E92B (09) : 2996 - 2999
  • [26] The ε-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times
    Kolovsky, Frantisek
    Jezek, Jan
    Kolingerova, Ivana
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2019, 8 (12)
  • [27] An A* Algorithm Framework for the point-to-point Time-Dependent Shortest Path Problem
    Ohshima, Tatsuya
    Eumthurapojn, Pipaporn
    Zhao, Liang
    Nagamochi, Hiroshi
    COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 2011, 7033 : 154 - +
  • [28] Improved ant colony algorithm for shortest path problem in time-dependent networks
    Liu, Yongqiang
    Chang, Qing
    Xiong, Huagang
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2009, 35 (10): : 1245 - 1248
  • [29] Reinforcement Learning for Shortest Path Problem on Stochastic Time-Dependent Road Network
    Zhang, Ke
    Li, Meng
    Shan, Yu
    CICTP 2021: ADVANCED TRANSPORTATION, ENHANCED CONNECTION, 2021, : 410 - 417
  • [30] Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS
    Nejad, Mark Mahyar
    Mashayekhy, Lena
    Chinnam, Ratna Babu
    Phillips, Anthony
    IIE TRANSACTIONS, 2016, 48 (02) : 158 - 169