Evaluation of shortest path of network by using an intuitionistic pentagonal fuzzy number with interval values
by Prasanta Kumar Raut; Siva Prasad Behera
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 16, No. 2, 2024

Abstract: Shortest path problems of weighted graphs and networks are extensively used as optimisation tools in numerous problems in different application domains. This optimisation problem is used for determining the shortest path of a fuzzy associated network between two given nodes known as source and destination. Normally, mathematical models may fail to find the proper result, but fuzzy logic can handle it very easily and give the desired result. This work designs an algorithm that computes a path of minimum length along with the shortest length of an interval-valued intuitionistic fuzzy graph with vertices assuming weights that are crisp numbers and the edges assuming weights that are intuitionistic interval-valued pentagonal fuzzy numbers (IIPFNs). Further, we explain our results with the help of a numerical problem.

Online publication date: Sat, 18-May-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com