Searching Path by Applying Intelligent Techniques

The shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map; In this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. In this paper, we propose a simple method to find the shortest path by using intelligent technique like fuzzy logic. In this paper edge weights of the network are considered as fuzzy numbers so that the imprecise data values can be represented.