Premium
An intelligent search path
Author(s) -
Yadav Kiran,
Biswas Ranjit
Publication year - 2010
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20434
Subject(s) - shortest path problem , path (computing) , computer science , enhanced data rates for gsm evolution , distance , path graph , simple (philosophy) , graph theory , fuzzy logic , graph , mathematics , algorithm , combinatorics , artificial intelligence , theoretical computer science , line graph , philosophy , epistemology , graph power , programming language
In graph theory, 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, a simple method to find the shortest path in a fuzzy environment is proposed. Here the edge weights of the network are considered as fuzzy numbers so that the imprecise data values can be represented. © 2010 Wiley Periodicals, Inc.