Paper Info
Title
Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using alpha-cuts
Abstract
We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α-cuts by proposing a linear least squares model to obtain membership functions for the considered additions. Then, using a recently proposed distance function for comparison of fuzzy numbers, we present a dynamic programming method for finding a shortest path in the network. Examples are worked out to illustrate the applicability of the proposed model.
Year
DOI
Venue
2010
10.1016/j.camwa.2010.03.038
Computers & Mathematics with Applications
Keywords
DocType
Volume
Fuzzy numbers,α-cut,Distance function,Shortest path,Linear least squares,Regression,Dynamic programming
Journal
60
Issue
ISSN
Citations 
4
0898-1221
2
PageRank 
References 
Authors
0.37
0
4
Name
Order
Citations
PageRank
Ali Tajdin1192.52
Iraj Mahdavi238832.30
Nezam Mahdavi-amiri337139.95
Bahram Sadeghpour Gildeh4358.99