| Autor: |
Dey, Arindam, Broumi, Said, Kumar, Ranjan, Pratihar, Jayanta |
| Předmět: |
|
| Zdroj: |
International Journal of Neutrosophic Science (IJNS); 2024, Vol. 23 Issue 3, p288-295, 8p |
| Abstrakt: |
Dijkstra's algorithm (DA) is a very popular approach for finding the shortest route (SR) in the shortest route problem (SRP). The SRP becomes a challenging and complex problem in real life scenarios. The Fermatean neutrosophic set is a mathematical model that combines Fermatean sets with neutrosophic sets. It can handle the unclear, ambiguous, inconsistent, confusing, and uncertain information that comes from real-world problems. Decision-makers face difficulty accurately determining the precise membership (MG) and non membership levels due to the lack of appropriate data available. The FNS can handle this problem. In this study, we consider the interval FNS to describe the arc weight of a neutrosophic graph (NG). This SRP is called an interval Fermatean neutrosophic shortest route problem (IFNSRP). A modified DA is presented to solve this IFNSRP in an uncertain environment. The effectiveness of the presented method is illustrated with a numerical instance of a neutrosophic network. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
