Routing Planning As An Application Of Graph Theory

ABSTRACT- This paper presents a routing algorithm that uses fuzzy logic technique to find the shortest routing path. The basic idea behind path finding is searching a graph starting at one point and exploring adjacent nodes from there until the destination node is reached. Generally the goal is of course to obtain the shortest route to the destination. The proposed Fuzzy Routing Algorithm FRA modifies the well-known Dijkstras Single-source shortest path algorithm by using fuzzy-logic membership functions in the path-cost update process. The main objective of FRA is to reduce path-request blocking and increase overall utilization. The fuzzy weighted graphs along with generalizations of algorithms for finding optimal paths within them have emerged as an adequate modeling tool for prohibitively complex andor inherently imprecise systems. These algorithms are reviewed and formulized with uncertainty which comes from weights on edges according to actual situation on the road such as weather conditions and road capacity at the specified time. The two key issues need to be addressed in SPPShortest Path Algorithm with fuzzy parameters are to determine the addition of two edges and to compare the distance between two different paths with their edge lengths represented by fuzzy numbers.