Loading...

Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using α-cuts

Tajdin, A ; Sharif University of Technology | 2010

684 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.camwa.2010.03.038
  3. Publisher: 2010
  4. Abstract:
  5. 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
  6. Keywords:
  7. A-cut ; Distance function ; Regression ; Arc length ; Distance functions ; Dynamic programming methods ; Fuzzy numbers ; Linear least squares ; Linear least-squares model ; Shortest path ; Channel capacity ; Computation theory ; Fuzzy rules ; Fuzzy sets ; Graph theory ; Membership functions ; Surface reconstruction ; Dynamic programming
  8. Source: Computers and Mathematics with Applications ; Volume 60, Issue 4 , 2010 , Pages 989-1002 ; 08981221 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0898122110002270