Fuzzy shortest path problem based on triangular density function
Author & Affiliation:
L. Sujatha (sujathajayasankar@yahoo.co.in.
Lecturer Department of Mathematics, Auxilium College (Autonomous) , Vellore - 6 and Research Scholar, Dravidian University, Kuppam (A.P.) INDIA
R. Sattanathan(rsttanathan@gmail.com)
Reader and Head P.G. & Research Department of Mathematics, D.G. Vaishnav College, Chennai - 106 (INDIA)
Keyword:
u00a0Fuzzy Shortest Path, Network, Triangular Fuzzy Number, Triangular Density Function, Similarity Degree
Issue Date:
December 2009
Abstract:
The Shortest Path Problem is a classical and important network optimization problem which plays a major role in many applications. It has been proposed to find the Fuzzy Shortest Path using Similarity Degree where Triangular Density Function is used.
Pages:
731-738
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
L. Sujatha; R. Sattanathan, "Fuzzy shortest path problem based on triangular density function", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 3, Page Number 731-738, 2018Copy the following to cite this URL:
L. Sujatha; R. Sattanathan, "Fuzzy shortest path problem based on triangular density function", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 3, Page Number 731-738, 2018Available from: https://www.ultrascientist.org/paper/1250/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
