The most well-known subject in graph theory is the shortest path problem (SPP), which has
real-world applications in several different fields of study, including transportation …

Shortest path problems in graph theory are applicable in areas like emergency services,
mapping software, and computer networks. Fuzzy arc weights introduce uncertainty, typically …

Chronic kidney disease (CKD) represents a significant global health challenge in society,
and early detection of risk is essential for on-time treatment and intervention. This research …

The Traveling Salesman Problem (TSP) is one of the most significant and well-known
optimization problem that is frequently limited by uncertainty in edge lengths. Existing …

In The traveling salesman problem (TSP) is an essential and the most popular conventional
combinatorial optimization network problem in operations research, in which the TSP …

Solving the shortest path problem (SPP) by the Floyd-Warshall algorithm (FWA) is often
found in the literature. In this article, we propose a fuzzy Floyd-Warshall algorithm for …

Shortest path problems of weighted graphs and networks are extensively used as
optimisation tools in numerous problems in different application domains. This optimisation …

In a given network there exist many paths from source to destination, among all selected
paths finding the optimal shortest path is a challenging task. In this research paper, we …