Finding Shortest Path in a Network Using Trapezoidal Intuitionistic Fuzzy Number
| Vol-4 | Issue-02 | February 2019 | Published Online: 10 February 2019 PDF ( 578 KB ) | ||
| DOI: https://doi.org/10.5281/zenodo.2561577 | ||
| Author(s) | ||
Maheswari D
1;
Harshini K
2
|
||
|
1Assistant professor, Department of Mathematics, Sri Krishna Arts and Science College, Coimbatore (India) 2PG Scholar, Department of Mathematics, Sri Krishna Arts and Science College, Coimbatore (India) |
||
| Abstract | ||
In this paper, we present an algorithm to find the shortest path from a source node to a destination node on a network using α-cut and Euclidean distance. We also solved a numerical example in which each edge assigns activity duration as trapezoidal intuitionistic fuzzy numbers. |
||
| Keywords | ||
| Network, Trapezoidal Intuitionistic Fuzzy number, α-cut set, Euclidean distance, shortest path | ||
|
Statistics
Article View: 670
|
||
