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

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...

Full description

Bibliographic Details
Main Authors: Asim Basha M, Mohammed Jabarulla M
Format: Article
Language:English
Published: Accademia Piceno Aprutina dei Velati 2023-03-01
Series:Ratio Mathematica
Subjects:
Online Access:http://eiris.it/ojs/index.php/ratiomathematica/article/view/1064
Description
Summary: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.
ISSN:1592-7415
2282-8214