A New Approach for Solving Type-2 Fuzzy Shortest Path Problem

Abstract

Abstract. In a network the arc lengths may represent time or cost. In practical situations, it is reasonable to assume that each arc length is a type-2 discrete fuzzy set. We called it the type-2 discrete fuzzy shortest path problem. In this paper we proposed an algorithm for finding shortest path and shortest path length from source node to destination… (More)

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Anusuya2014ANA, title={A New Approach for Solving Type-2 Fuzzy Shortest Path Problem}, author={V. Anusuya and R. Sathya}, year={2014} }