Shortest Path Problem under Pythagorean Fuzzy Network Using Dijkstra’s Algorithm

M. Mohammed Jabarulla

PG & Research Department of Mathematics, Jamal Mohamed College, (Affiliated to Bharathidasan University), Tiruchirappalli 620 020, Tamil Nadu, India.

M. Asim Basha *

PG & Research Department of Mathematics, Jamal Mohamed College, (Affiliated to Bharathidasan University), Tiruchirappalli 620 020, Tamil Nadu, India.

*Author to whom correspondence should be addressed.


Abstract

In this article investigates the Shortest Path Problem (SPP) in uncertain settings using Pythagorean fuzzy numbers (PFNs). A heuristic methodology using modified Dijkstra's algorithm is developed to exploit error, uncertainty, and partial truth for a low-cost solution. The method calculates minimum distance between starting and destination nodes and evaluates its effectiveness. Pythagorean fuzzy graphs can handle ambiguous situations.

Keywords: Pythagorean fuzzy graph (PFG), triangular pythagorean fuzzy number (TriPFN), ranking functions, dijkstra’s algorithm, triangular pythagorean fuzzy shortest path problem (TriPFSPP)


How to Cite

Jabarulla, M. Mohammed, and M. Asim Basha. 2024. “Shortest Path Problem under Pythagorean Fuzzy Network Using Dijkstra’s Algorithm”. Asian Research Journal of Mathematics 20 (10):47-57. https://doi.org/10.9734/arjom/2024/v20i10844.