FUZZY MODELS AND HEURISTIC ALGORITHMS FOR A CLASS OF GRAPH PROBLEMS

Abstract

Graphs can represent the pair wise relations between the objects from a collection and can be denoted as , , where and signifies the set of vertices and set of edges respectively. Graphs find application in several real life areas like in the GPS system, social networking sites, telecommunication industry, computer science and mathematics etc. In most of the applications, weighted graphs are used, where the weights associated with the edges and the nodes represent the parameters like delay, cost, time, score, distance, capacity etc., which cannot be determined precisely. Therefore, the best way to deal with prevailing uncertainty, is to use fuzzy numbers (instead of crisp numbers) to represent these parameters.