Algorithm Approaches for Shortest Path Problem in an Interval - Valued Triangular Pythagorean Fuzzy Network

Asim Basha M, Mohammed Jabarulla M

Abstract


It has been proposed to use Pythagorean fuzzy sets (PFS), is an extension of fuzzy sets (FSs), to address uncertainty in practical decision
– making problems. Then the Shortest Path Problem (SPP) is a well
– known network improvement issue with numerous practical applications. Then the shortest Path (SP) and the shortest distance (SD)
in an Interval – valued Pythagorean fuzzy graph (I-VPFG) are found
using a method in the current communication. Nodes and connections are crisp, while the edge weights are I-V triangular Pythagorean
fuzzy numbers (I-VTPFN). Additionally, a numerical example has
been used to demonstrate the suggested strategy.

Keywords


I - V Pythagorean fuzzy sets (I-VPFS), I – V Pythagorean fuzzy graph (I-VPFG), I – V triangular Pythagorean fuzzy number (IVTPFN), ranking function (RF), I – V Pythagorean fuzzy shortest path problem (I-VPFSPP)

Full Text:

PDF

References


K. Atanassov. Intuitionistic fuzzy sets. Fuzzy sets Systems, 20:87–96, 1986.

K. Atanassov and G. Gargov. Interval – valued intuitionistic fuzzy sets. Fuzzy

sets and Systems, 31:343–349, 1989.

D. Dubois and H. . Prade. Fuzzy sets and systems. academic Press, New York,

NY, USA, 1980.

A. Gani and M. M. Jabarulla. On searching intuitionistic fuzzy shortest path in a

network,. Applied Mathematical Sciences,, 4:3447–3454, 2010.

H. Garg. A novel accuracy function under interval – valued pythagorean fuzzy

environment for solving multicriteria decision making problems. J Intell Fuzzy

Systems, pages 529–540, 2016.

M. Karunambigai, P. Ranagasmy, K. Atanassov, and N. N. An intuitionistic fuzzy

graph method for finding the shortest paths in networks. Advances in soft Computing, pages 3–10, 2007.M. Asim Basha,M. Mohammed Jabarulla

A. Kumar and M. Kaur. A new algorithm for solving network flow with fuzzy

arc lenths. An official Journal of Turkish Fuzzy systems Association, pages 1–3,

G. Kumar, R. Bajaj, and N. Gandotra. Interval – valued fuzzy sub semi – groups

and subgroups associated by interval – valued fuzzy graphs,. in Proceedings

of the WRI Global congress on Intelligent Systems (GCIS’09), pages 484–487,

G. Kumar, R. K. Bajaj, and N. Gandotra. Algorithm for shortest path problem in

a network with interval – valued intuitionistic trapezoidal fuzzy number,. International Conference on Eco-friendly Computing and Communication Systems,,

S. Y. Mohamed and A. M. Ali. On strong interval – valued pythagorean fuzzy

graph,. Journal of Applied Science and Computations., 5, 2018.

S. Naz, S. Ashraf, and M. Akram. A novel approach to decision making with

pythagorean fuzzy information,. Mathematics, 5:37–46, 2013.

S. Okada. Fuzzy shortest path problems incorporating among paths. Fuzzy sets

and Systems, 142:335–357, 2004.

P. Xindong and Y. Young. Fundamental properties of interval – valued

pythagorean fuzzy aggregation operators. International Journal of Intelligent

Systems, 31:444–487, 2016.

Z. Xu and Zhang. Extension of topsis to multiple criteria decision making with

pythagorean fuzzy sets. Int. J. Intell. Systems., 29:1061–1078, 2014.

R. Yager. Pythagorean fuzzy subsets. In Proceedings of the joint IFSA World

congress and NAFIPS Annual Meeting, Edmonton, AB, Canada,, pages 24–28,

R. Yager. Pythagorean membership grades in multi-criteria decision making.

IEEE Trans. Fuzzy Systems, 22:958–965, 2014.

J. Yao and F. Lin. Fuzzy shortest – path network problems with uncertain edge

weights. Journal of Information Science and Engineering, 19:329–351, 2003.

L. Zadeh. Fuzzy sets,. Information and Control,, 8:338–353, 1965.




DOI: http://dx.doi.org/10.23755/rm.v46i0.1064

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Asim Basha M, Mohammed Jabarulla M

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.