Abstract
The shortest path problem is one of the most studied problems in Intuitionistic fuzzy sets and systems area. Thus many authors discussed about Fuzzy shortest path problem in a network. This paper proposes a new algorithm to deal with the Intuitionistic fuzzy shortest path problem. It is composed of Intuitionistic fuzzy shortest path length procedure and similarity measure. In network problem the length of the paths are represented by triangular and trapezoidal Intuitionistic fuzzy number. In this paper the highest similarity degree is utilized to identify the shortest path. An illustrative example is also including demonstrating our proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
