Published February 10, 2019
| Version v1
Journal article
Open
Finding Shortest Path in a Network Using Trapezoidal Intuitionistic Fuzzy Number
Creators
- 1. Assistant professor, Department of Mathematics, Sri Krishna Arts and Science College, Coimbatore (India)
- 2. PG Scholar, Department of Mathematics, Sri Krishna Arts and Science College, Coimbatore (India)
Description
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.
Files
29-31_RRIJM190402007.pdf
Files
(592.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c5ce3c25cc47f0853012e25b722b7712
|
592.2 kB | Preview Download |