Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...

The degree of similarity or dissimilarity between the objects under study plays an important role. In vector space, especially, the cosine similarity measure is often used in information retrieval, citation analysis, and automatic classification. However, it scarcely deals with trapezoidal fuzzy information and multicriteria decision-making problems. For this purpose, a cosine similarity measur...

Fuzzy differential equation models are suitable where uncertainty exists for real-world phenomena. Numerical techniques used to provide an approximate solution these in the absence of exact solution. However, existing studies that have developed numerical solving FIVPs possess absolute error accuracy could be improved. This is as a result low order and non-self-starting properties by previous s...

Linear programming problems with trapezoidal fuzzy numbers have recently attracted much interest. Various methods have been developed for solving these types of problems. Here, following the work of Ganesan and Veeramani and using the recent approach of Mahdavi-Amiri and Nasseri, we introduce the dual of the linear programming problem with symmetric trapezoidal fuzzy numbers and establish some ...

Several algorithms exist to determine the shortest path in a network for the crisp case where the weights are real numbers. In the real world, these weights represent parameters like cost, packet arrival time, link capacity etc which are not naturally precise. To model the uncertainty involved, for the first time we use the Gaussian fuzzy numbers as weights and a method has been presented in th...