Abstract—This paper, presents a method to find the shortest distance path between two vertices on a fuzzy weighted graph, that is vertices (or nodes) and edges (or links) remain crisp, but the edge weights will be fuzzy numbers.. We propose an algorithm to deal with fuzzy shortest path problem. The algorithm first finds the shortest path length and then a similarity measure degree is taken to find out the shortest paths.
Index Terms—Fuzzy sets, Shortest path problem, Similarity measure, Weighted graph.
F. A. Author Kiran Yadav Department of Computer Science & Information Technology, ITM, INDIA (e-mail: firstname.lastname@example.org)
S. B. Author, Rajit Biswas, Department of Computer Science & Information Technology, ITM, INDIA.
Cite: Kiran Yadav and Ranjit Biswas, "Finding a Shortest Path Using an Intelligent Technique," International
Journal of Engineering and Technology vol. 1, no. 2, pp. 139-141, 2009.